-
Notifications
You must be signed in to change notification settings - Fork 7
/
Program.cs
55 lines (54 loc) · 1.47 KB
/
Program.cs
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
using System;
using System.Linq;
namespace DiagonalTraverse
{
class Program
{
static void Main(string[] args)
{
int[][] matrix = new int[3][];
matrix[0] = new int[] {1, 2, 3};
matrix[1] = new int[] {4, 5, 6};
matrix[2] = new int[] {7, 8, 9};
Console.WriteLine(FindDiagonalOrder(matrix));
}
static int[] FindDiagonalOrder(int[][] matrix)
{
if (matrix.Length == 0 || matrix[0].Length == 0)
return new int[0];
int col = matrix.Length, row = matrix[0].Length;
int m = 0, n = 0;
int[] res = new int[row * col];
bool flag = true;
for (int i = 0; i < row * col; i++)
{
res[i] = matrix[m][n];
if (flag)
{
n += 1; m -= 1;
}
else
{
n -= 1; m += 1;
}
if (m >= col)
{
m -= 1; n += 2; flag = true;
}
else if (n >= row)
{
n -= 1; m += 2; flag = false;
}
if (m < 0)
{
m = 0; flag = false;
}
else if (n < 0)
{
n = 0; flag = true;
}
}
return res;
}
}
}