498. Diagonal Traverse

ujn20161222

于 2024-10-24 13:12:51 发布

阅读量108

点赞数 1

CC 4.0 BY-SA版权

文章标签： leetcode

本文链接：https://blog.csdn.net/ujn20161222/article/details/143206562

class Solution:
    def findDiagonalOrder(self, mat: List[List[int]]) -> List[int]:
        output=[]
        hm=defaultdict(list)
        for i in range(len(mat)):
            for j in range(len(mat[0])):
                hm[i+j].append(mat[i][j])
        
        for k,v in hm.items():
            if k%2==0:
                output.extend(v[::-1])
            else:
                output.extend(v)
        return output