LC-1030 Easy LeetCode

1030. Matrix Cells in Distance Order

Read the full problem statement on LeetCode.

Difficulty: easy Acceptance: 73% Topics: Array, Math, Geometry, Sorting, Matrix

Reading material

Arrays & Hashing 12 min Math & Geometry 12 min Sorting 13 min

Reference solution (spoiler · python)

# Time:  O(m * n)
# Space: O(1)

class Solution(object):
    def allCellsDistOrder(self, R, C, r0, c0):
        """
        :type R: int
        :type C: int
        :type r0: int
        :type c0: int
        :rtype: List[List[int]]
        """
        def append(R, C, r, c, result):
            if 0 <= r < R and 0 <= c < C:
                result.append([r, c])
            
        result = [[r0, c0]]
        for d in xrange(1, R+C):
            append(R, C, r0-d, c0, result)
            for x in xrange(-d+1, d):
                append(R, C, r0+x, c0+abs(x)-d, result)
                append(R, C, r0+x, c0+d-abs(x), result)
            append(R, C, r0+d, c0, result)
        return result

Solution from kamyu104/LeetCode-Solutions · MIT