【leetcode】Array—— Minimum Path Sum（64）

题目：

Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path.

Note: You can only move either down or right at any point in time.

思路：第一反应就是DP，比较容易

代码：

    	//init first row
    	int sum=0;
    	for(int i=0;i<col;i++){
    		re[0][i]=grid[0][i]+sum;
    		sum+=grid[0][i];
    	}
    	//inite first col
    	sum=0;
    	for(int i=0;i<row;i++){
    		re[i][0]=grid[i][0]+sum;
    		sum+=grid[i][0];
    	}
    	//dp
    	for(int i=1;i<row;i++){
    		for(int j=1;j<col;j++){
    			re[i][j]=grid[i][j]+(re[i-1][j]<=re[i][j-1]?re[i-1][j]:re[i][j-1]);
    		}
    	}

后来想一下，不需要extra space，可以直接在grid数组里面操作

leetcode给的思路也是大同小异，虽然看起来简练了，但是运行速度降低了

    public int minPathSum(int[][] grid) {
    	int row=grid.length;int col=grid[0].length;
    	for(int i=0;i<row;i++){
    		for(int j=0;j<col;j++){
    			if(i==0&&j==0) continue;
    			if(i==0)
    				grid[i][j]=grid[i][j]+grid[i][j-1];
    			else if(j==0)
    				grid[i][j]=grid[i][j]+grid[i-1][j];
    			else
    				grid[i][j]=grid[i][j]+(grid[i-1][j]<=grid[i][j-1]?grid[i-1][j]:grid[i][j-1]);
    		}
    	}
        return grid[row-1][col-1];
    }