leetcode-5394-对角线遍历②

class Solution:
    def findDiagonalOrder(self, nums: List[List[int]]) -> List[int]:
        a,s,m=[(0,0)],[nums[0][0]],len(nums)
        while a:
            b=[]
            for i,j in a:
                for ii,jj in (i+1,j),(i,j+1):
                    if ii<m and jj<len(nums[ii]) and nums[ii][jj]!=-1:
                        s.append(nums[ii][jj])
                        b.append((ii,jj))
                        nums[ii][jj]=-1
            a=b
        return s

class Solution:
    def findDiagonalOrder(self, nums: List[List[int]]) -> List[int]:
        ans = []
        for i, l in enumerate(nums):
            for j, n in enumerate(l):
                ans.append((i + j, j, n))
        ans.sort()
        return [a[2] for a in ans]