498. Diagonal Traverse 对角线遍历矩阵

 Given a matrix of M x N elements (M rows, N columns), return all elements of the matrix in diagonal order as shown in the below image.

Example:

Input:
[
 [ 1, 2, 3 ],
 [ 4, 5, 6 ],
 [ 7, 8, 9 ]
]
Output:  [1,2,4,7,5,3,6,8,9]
Explanation:

Note:

1. The total number of elements of the given matrix will not exceed 10,000.

1. class Solution:
2. def findDiagonalOrder(self, matrix):
3. """
4. :type matrix: List[List[int]]
5. :rtype: List[int]
6. """
7. if not matrix or not matrix[0]:
8. return []
9. res = []
10. isRe = 1
12. def addLine(row, col, isRe):
13. line = []
14. while row < len(matrix) and col >= 0:
15. line.append(matrix[row][col])
16. row += 1
17. col -= 1
19. l = len(res)
20. if isRe:
21. res[l:l] = line[::-1]
22. else:
23. res[l:l] = line
25. for i in range(len(matrix[0])):
26. addLine(0, i, isRe)
27. isRe ^= 1
28. for i in range(1, len(matrix)):
29. addLine(i, len(matrix[i]) - 1, isRe)
30. isRe ^= 1
32. return res

来自为知笔记(Wiz)

转载于:https://www.cnblogs.com/xiejunzhao/p/8419850.html