LeetCOde 64 Minimum Path Sum

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.

	public int minPathSum(int[][] grid) {
		int row = grid.length;
		int column = grid[0].length;
		int[] path = new int[column];
		path[0] = 0;
		for (int i = 1; i < column; i++)
			path[i] = Integer.MAX_VALUE;
		//path[j]的值为第i行第j列当前从左上角到达此点的最小值.
		for (int i = 0; i < row; i++) {
			path[0] = path[0] + grid[i][0];
			for (int j = 1; j < column; j++) {
				path[j] = Math.min(path[j - 1], path[j]) + grid[i][j];
			}
		}
		return path[column - 1];
	}

这种方法好理解一点：

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