목록1329. Sort the Matrix Diagonally (1)

Scribbling

LeetCode: 1329. Sort the Matrix Diagonally

class Solution: def diagonalSort(self, mat: List[List[int]]) -> List[List[int]]: m, n = len(mat), len(mat[0]) starting_points = [(0, i) for i in range(n)] + [(i, 0) for i in range(1, m)] for starting_point in starting_points: array = [] y, x = starting_point while y
Computer Science/Coding Test 2021. 11. 24. 14:45
이전 Prev 1 Next 다음