1030. 距离顺序排列矩阵单元格

 

思路：
　　声明矩阵list；
　　返回按曼哈顿距离排序的list；

class Solution(object):

    def allCellsDistOrder2(self, R, C, r0, c0):
        """
        :type R: int
        :type C: int
        :type r0: int
        :type c0: int
        :rtype: List[List[int]]
        """
        dist = [[i, j] for i in range(R) for j in range(C)]
        dist.sort(key=lambda x: abs(x[0] - r0) + abs(x[1] - c0))
        return dist

    def allCellsDistOrder(self, R, C, r0, c0):
        """
        :type R: int
        :type C: int
        :type r0: int
        :type c0: int
        :rtype: List[List[int]]
        """
        # 返回值
        dist_list = [[] for i in range(200)]
        # print(dist_list)
        # 计算距离并排序
        for i in range(R):
            for j in range(C):
                distinct = abs(r0 - i) + abs(c0 - j)
                # 将坐标插入距离对应的dist_list下标处
                dist_list[distinct].append([i, j])
        result = []
        # 遍历dist_list，不为空则添加到result中
        for i in dist_list:
            if i:
                result.extend(i)
            else:
                break
        return result


if __name__ == '__main__':
    solution = Solution()
    print(solution.allCellsDistOrder(R=1, C=2, r0=0, c0=0))