给你一个 m * n
的整数矩阵 mat
,请你将同一条对角线上的元素(从左上到右下)按升序排序后,返回排好序的矩阵。
示例 1:
输入:mat = [[3,3,1,1],[2,2,1,2],[1,1,1,2]]
输出:[[1,1,1,1],[1,2,2,2],[1,2,3,3]]
提示:
m == mat.length
n == mat[i].length
1 <= m, n <= 100
1 <= mat[i][j] <= 100
思路:
按照题意,把所有对角线上的元素都提取到一个数组里,排好序,再放回矩阵中。
时间复杂度:O(MN + KlogK),K = max(M,N)
空间复杂度: O(K)
class Solution(object):
def diagonalSort(self, mat):
"""
:type mat: List[List[int]]
:rtype: List[List[int]]
"""
if not mat or not mat[0]:
return None
m, n = len(mat), len(mat[0])
for j in range(n):
i, l, pos = 0, [], []
while i < m and j < n:
l.append(mat[i][j])
pos.append([i, j])
i += 1
j += 1
l.sort()
for i, p in enumerate(pos):
x, y = p
mat[x][y] = l[i]
for i in range(1, m):
j, l, pos = 0, [], []
while i < m and j < n:
l.append(mat[i][j])
pos.append([i, j])
i += 1
j += 1
l.sort()
for i, p in enumerate(pos):
x, y = p
mat[x][y] = l[I]
return mat