10 line - 3ms - Easy to Understand code


  • 0
    A
                    int row = grid.length;
    	        int col = grid[0].length;
    	        for(int i=1;i<row;i++)
    	        	grid[i][0] = grid[i][0]+grid[i-1][0];
    	        for(int j=1;j<col;j++)
    	        	grid[0][j] = grid[0][j-1]+grid[0][j];
    	        for(int i=1;i<row;i++)
    	        {
    	        	for(int j=1;j<col;j++)
    	        	{
    	        		grid[i][j] = grid[i][j] + Math.min(grid[i-1][j], grid[i][j-1]);
    	        	}
    	        }
    	        return grid[row-1][col-1];
    

Log in to reply
 

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