Beats 100% C solution


  • 0
    A
        int minPathSum(int** grid, int gridRowSize, int gridColSize) {
            int amount;
            for(int j=1;j<gridColSize;j++)
                grid[0][j]+=grid[0][j-1];
            for(int i=1;i<gridRowSize;i++)
                grid[i][0]+=grid[i-1][0];
            for(int i=1;i<gridRowSize;i++)
                for(int j=1;j<gridColSize;j++){
                    amount = grid[i-1][j]<grid[i][j-1] ? grid[i-1][j] : grid[i][j-1] ; 
                    grid[i][j] +=amount;
                }
            return grid[gridRowSize-1][gridColSize-1];
       }

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.