JAVA_LeetCode 3402_Minimum Operations to Make Columns Strictly Increasing

풀이 class Solution { public int minimumOperations(int[][] grid) { // 각 열별 증가값(위에서 아래로 증가)을 독립적으로 체크해서 더해줘야함 int sum = 0; for(int j = 0; j < grid[0].length; j++){ for(int i = 1; i < grid.length; i++){ if(grid[i][j] <= grid[i - 1][j]){ sum += grid[i - 1][j] - grid[i][j] + 1; grid[i][j] = grid[i - 1][j] + 1; } } } return sum; } } * 출처 https://leetcode.com/problems/minimum-operations-to-make-columns-strictly-increasing...