1424. Diagonal Traverse II

ujn20161222

于 2024-10-25 14:26:16 发布

阅读量174

点赞数 1

CC 4.0 BY-SA版权

文章标签： leetcode

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

1424. Diagonal Traverse II

class Solution:
    def findDiagonalOrder(self, nums: List[List[int]]) -> List[int]:
        if not nums:return []
        res=[]
        queue=deque([(0,0)])
        while queue:
            row,col=queue.popleft()
            res.append(nums[row][col])
            if col==0 and row+1<len(nums):
                    queue.append([row+1,col])
            if col+1<len(nums[row]):
                queue.append([row,col+1])
        return res