LeetCode 1329. 将矩阵按对角线排序

示例 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]]
示例 2：

输入：mat = [[11,25,66,1,69,7],[23,55,17,45,15,52],[75,31,36,44,58,8],[22,27,33,25,68,4],[84,28,14,11,5,50]]
输出：[[5,17,4,1,52,7],[11,11,25,45,8,69],[14,23,25,44,58,15],[22,27,31,36,50,66],[84,28,75,33,55,68]]

class Solution:
    def diagonalSort(self, mat: List[List[int]]) -> List[List[int]]:
        row , col = len(mat), len(mat[0])
        # 配置遍历的初始点数组，然后进行遍历
        startPoints = [(0,x) for x in range(col)]+[ (y,0) for y in range(row)]
        startPoints.pop(0)#把重复的(0,0)去掉
        # print(startPoints)
        for x, y in startPoints:
            step = min(abs(row-1-x),abs(col-1-y))#先获取行走步数
            # 获取斜线数组
            lineList = [(x+i, y+i) for i in range(step+1)]
            # 获取斜线上全部数组的内容，然后排序，重新赋值
            pointList = [mat[i][j] for i,j in lineList]
            # print(pointList)
            pointList.sort()
            for i, j in lineList:
                mat[i][j] = pointList.pop(0)
        # print(mat)
        return mat

if __name__ == '__main__':
    mat = [[3,3,1,1],[2,2,1,2],[1,1,1,2]]
    ret = Solution().diagonalSort(mat)
    print(ret)