leetcode每日一题：1030 距离顺序排列矩阵单元格

class Solution:
    def allCellsDistOrder(self, R, C, r0, c0):
        dist_list = [[] for i in range(201)]  # 初始化存储列表
        for i in range(R):
            for j in range(C):
                distinct = abs(r0-i) + abs(c0-j)  # 计算每个点到起点的距离
                dist_list[distinct].append([i, j])
        result = []
        
        for i in dist_list:  # 遍历
            if i:  # 如果该distance有list结果
                result.extend(i)  # 扩展起来
            else:
                continue  # 如果为空，继续遍历
        return result

class Solution:
    def allCellsDistOrder(self, R: int, C: int, r0: int, c0: int) -> List[List[int]]:
        return sorted([[i,j] for i in range(R) for j in range(C)],
                key = lambda x : abs((x[0]-r0)) + abs((x[1]-c0)))