LC-3402 Easy LeetCode

3402. Minimum Operations to Make Columns Strictly Increasing

Read the full problem statement on LeetCode.

Difficulty: easy Acceptance: 72% Topics: Array, Greedy, Matrix

Reading material

Arrays & Hashing 12 min Greedy 11 min Math & Geometry 12 min

Reference solution (spoiler · python)

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

# greedy
class Solution(object):
    def minimumOperations(self, grid):
        """
        :type grid: List[List[int]]
        :rtype: int
        """
        result = 0
        for i in xrange(len(grid)-1):
            for j in xrange(len(grid[0])):
                if grid[i][j]+1 <= grid[i+1][j]:
                    continue
                result += (grid[i][j]+1)-grid[i+1][j]
                grid[i+1][j] = grid[i][j]+1
        return result

Solution from kamyu104/LeetCode-Solutions · MIT