One Line Python3 Solution
Intuition\nIterate through  all the point in matrix, get the distance from the Center Point, and then sort by the distance\n\n# Approach\nA simpler code is this
# Intuition\nIterate through  all the point in matrix, get the distance from the Center Point, and then sort by the distance\n\n# Approach\nA simpler code is this:\n\n- Define a lambda function to calculate the Manhattan distance between a point and the center point\n\n```\ndist = lambda point: abs(point[0] - rCenter) + abs(point[1] - cCenter)\n```\n\n- Generate a list containing all possible combinations of row and column indices within the matrix\n```\nindices = [[r,c] for r in range(rows) for c in range(cols)]\n```\n\n- Sort the list of indices based on their distances from the center using the dist function as the key\n```\nsorted_indices = sorted(indices, key=dist)\n```\n\n\n# Code\n```\nclass Solution:\n    def allCellsDistOrder(self, rows: int, cols: int, rCenter: int, cCenter: int) -> List[List[int]]:\n        return sorted([[r,c] for r in range(rows) for c in range(cols)], key=lambda point: abs(point[0] - rCenter) + abs(point[1] - cCenter))\n```
['Python3']