Class Solution

LeetCode_problems/Minimum Path Sum/Solution.java:17–32

*/

class Solution {
    public int minPathSum(int[][] grid) {
        for(int i=1;i<grid.length;++i){
            grid[i][0] += grid[i-1][0]; //moving down from top left and summing
        }
        for(int j=1;j<grid[0].length;++j){
            grid[0][j] += grid[0][j-1]; //moving right from top left and summing
        }
        for(int i = 1;i<grid.length;++i){
            for(int j = 1;j<grid[0].length;++j){
                    grid[i][j] += Math.min(grid[i][j-1],grid[i-1][j]);
            }
        }
        return grid[grid.length-1][grid[0].length-1];
    }
}