From 541227b060b59e181e3dfe4830624634d5ed6e50 Mon Sep 17 00:00:00 2001 From: MH Hung Date: Mon, 25 Aug 2025 10:18:32 +0800 Subject: [PATCH 1/4] [#498] feat(FindDiagonalOrder): Init issue --- .../498 FindDiagonalOrder/C#/FindDiagonalOrder.csproj | 10 ++++++++++ 202508/498 FindDiagonalOrder/C#/Program.cs | 5 +++++ 202508/498 FindDiagonalOrder/Go/main.go | 0 3 files changed, 15 insertions(+) create mode 100644 202508/498 FindDiagonalOrder/C#/FindDiagonalOrder.csproj create mode 100644 202508/498 FindDiagonalOrder/C#/Program.cs create mode 100644 202508/498 FindDiagonalOrder/Go/main.go diff --git a/202508/498 FindDiagonalOrder/C#/FindDiagonalOrder.csproj b/202508/498 FindDiagonalOrder/C#/FindDiagonalOrder.csproj new file mode 100644 index 0000000..2150e37 --- /dev/null +++ b/202508/498 FindDiagonalOrder/C#/FindDiagonalOrder.csproj @@ -0,0 +1,10 @@ + + + + Exe + net8.0 + enable + enable + + + diff --git a/202508/498 FindDiagonalOrder/C#/Program.cs b/202508/498 FindDiagonalOrder/C#/Program.cs new file mode 100644 index 0000000..1668ca8 --- /dev/null +++ b/202508/498 FindDiagonalOrder/C#/Program.cs @@ -0,0 +1,5 @@ +public class Solution { + public int[] FindDiagonalOrder(int[][] mat) { + + } +} \ No newline at end of file diff --git a/202508/498 FindDiagonalOrder/Go/main.go b/202508/498 FindDiagonalOrder/Go/main.go new file mode 100644 index 0000000..e69de29 -- 2.49.1 From 385787dbdc96832326faf1ff1bdff93aaa11f95f Mon Sep 17 00:00:00 2001 From: MH Hung Date: Mon, 25 Aug 2025 11:04:08 +0800 Subject: [PATCH 2/4] [#498] docs(FindDiagonalOrder) : add solution note --- 202508/498 FindDiagonalOrder/solution.md | 7 +++++++ 1 file changed, 7 insertions(+) create mode 100644 202508/498 FindDiagonalOrder/solution.md diff --git a/202508/498 FindDiagonalOrder/solution.md b/202508/498 FindDiagonalOrder/solution.md new file mode 100644 index 0000000..b855319 --- /dev/null +++ b/202508/498 FindDiagonalOrder/solution.md @@ -0,0 +1,7 @@ +1. 觀察矩陣對角線模式 + 1. (0,0) -> 1 -> i+j = 0 + 2. (1, 0), (0, 1) -> 2 -> i+j = 1 + 3. (2, 0), (1, 1), (0, 2) -> 3 -> i+j = 2 +2. how to deal with diagonal sorting? + 1. while (i+j) % 2 == 1 + 2. while (i+j) % 2 == 0 reversed \ No newline at end of file -- 2.49.1 From b8a053eff16d31dd85a051274f4f344ac2eafd4b Mon Sep 17 00:00:00 2001 From: MH Hung Date: Mon, 25 Aug 2025 11:04:55 +0800 Subject: [PATCH 3/4] [#498] feat(FindDiagonalOrder): add C# solution --- 202508/498 FindDiagonalOrder/C#/C#.sln | 24 +++++++++ 202508/498 FindDiagonalOrder/C#/Program.cs | 60 +++++++++++++++++++++- 2 files changed, 82 insertions(+), 2 deletions(-) create mode 100644 202508/498 FindDiagonalOrder/C#/C#.sln diff --git a/202508/498 FindDiagonalOrder/C#/C#.sln b/202508/498 FindDiagonalOrder/C#/C#.sln new file mode 100644 index 0000000..cd97c96 --- /dev/null +++ b/202508/498 FindDiagonalOrder/C#/C#.sln @@ -0,0 +1,24 @@ +Microsoft Visual Studio Solution File, Format Version 12.00 +# Visual Studio Version 17 +VisualStudioVersion = 17.5.2.0 +MinimumVisualStudioVersion = 10.0.40219.1 +Project("{FAE04EC0-301F-11D3-BF4B-00C04F79EFBC}") = "FindDiagonalOrder", "FindDiagonalOrder.csproj", "{B3151728-C057-4305-DD4C-9A2AFBFC189A}" +EndProject +Global + GlobalSection(SolutionConfigurationPlatforms) = preSolution + Debug|Any CPU = Debug|Any CPU + Release|Any CPU = Release|Any CPU + EndGlobalSection + GlobalSection(ProjectConfigurationPlatforms) = postSolution + {B3151728-C057-4305-DD4C-9A2AFBFC189A}.Debug|Any CPU.ActiveCfg = Debug|Any CPU + {B3151728-C057-4305-DD4C-9A2AFBFC189A}.Debug|Any CPU.Build.0 = Debug|Any CPU + {B3151728-C057-4305-DD4C-9A2AFBFC189A}.Release|Any CPU.ActiveCfg = Release|Any CPU + {B3151728-C057-4305-DD4C-9A2AFBFC189A}.Release|Any CPU.Build.0 = Release|Any CPU + EndGlobalSection + GlobalSection(SolutionProperties) = preSolution + HideSolutionNode = FALSE + EndGlobalSection + GlobalSection(ExtensibilityGlobals) = postSolution + SolutionGuid = {DB56539A-6F32-4D28-B91F-BB1DCF46F4D0} + EndGlobalSection +EndGlobal diff --git a/202508/498 FindDiagonalOrder/C#/Program.cs b/202508/498 FindDiagonalOrder/C#/Program.cs index 1668ca8..e1f13ce 100644 --- a/202508/498 FindDiagonalOrder/C#/Program.cs +++ b/202508/498 FindDiagonalOrder/C#/Program.cs @@ -1,5 +1,61 @@ public class Solution { - public int[] FindDiagonalOrder(int[][] mat) { - + public int[] FindDiagonalOrder(int[][] mat) + { + if (mat == null || mat.Length == 0 || mat[0].Length == 0) + { + return new int[0]; + } + + var m = mat.Length; + var n = mat[0].Length; + + var diagonals = new Dictionary>(); + + for (var i = 0; i < m; i++) + { + for (var j = 0; j < n; j++) + { + int diagonalIndex = i + j; + if (!diagonals.ContainsKey(diagonalIndex)) + { + diagonals[diagonalIndex] = new List(); + } + diagonals[diagonalIndex].Add(mat[i][j]); + } + } + + var result = new List(); + foreach (var key in diagonals.Keys) + { + var diagonal = diagonals[key]; + if (key % 2 == 0) + { + result.AddRange(diagonal); + } + else + { + diagonal.Reverse(); + result.AddRange(diagonal); + } + } + + return result.ToArray(); + } +} + +class Program +{ + static void Main() + { + var Solution = new Solution(); + + int[][] mat1 = new int[][]{ + new int[]{1,2,3}, + new int[]{4,5,6}, + new int[]{7,8,9} + }; + + Console.WriteLine(string.Join(", ", Solution.FindDiagonalOrder(mat1))); + } } \ No newline at end of file -- 2.49.1 From f25337364b0ec065e9e8a8af991d11889e80b05b Mon Sep 17 00:00:00 2001 From: MH Hung Date: Mon, 25 Aug 2025 11:57:30 +0800 Subject: [PATCH 4/4] [#498] feat(FindDiagonalOrder): add golang solution --- 202508/498 FindDiagonalOrder/Go/main.go | 45 +++++++++++++++++++++++++ 1 file changed, 45 insertions(+) diff --git a/202508/498 FindDiagonalOrder/Go/main.go b/202508/498 FindDiagonalOrder/Go/main.go index e69de29..f3fe8dc 100644 --- a/202508/498 FindDiagonalOrder/Go/main.go +++ b/202508/498 FindDiagonalOrder/Go/main.go @@ -0,0 +1,45 @@ +package main + +import "fmt" + +func findDiagonalOrder(mat [][]int) []int { + if len(mat) == 0 || len(mat[0]) == 0{ + return []int{} + } + + m := len(mat) + n := len(mat[0]) + + // maps + diagonals := make(map[int][]int) + + for i:=0; i< m;i++{ + for j:=0; j < n; j++{ + index := i+j + diagonals[index] = append(diagonals[index], mat[i][j]) + } + } + + result := []int{} + + for i:= 0; i< m+n-1; i++{ + if i% 2 == 0{ + reverse(diagonals[i]) + result = append(result, diagonals[i]...) + }else{ + result = append(result, diagonals[i]...) + } + } + + return result +} + +func reverse(slice []int){ + left, right :=0, len(slice)-1 + + for left < right{ + slice[left], slice[right] = slice[right], slice[left] + left++ + right-- + } +} \ No newline at end of file -- 2.49.1