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.

class Solution {
public:
    int minPathSum(vector<vector<int> > &grid)
	{
		if (grid.empty()) return 0;

        for (int i = 1; i < grid.size(); i++)
			grid[i][0] += grid[i - 1][0];
		for (int i = 1; i < grid[0].size(); i++)
			grid[0][i] += grid[0][i - 1];

		for (int i = 1; i < grid.size(); i++)
			for (int j = 1; j < grid[0].size(); j++)
				grid[i][j] += grid[i - 1][j] > grid[i][j - 1] ?
				grid[i][j - 1] : grid[i - 1][j];
		return grid[grid.size() - 1][grid[0].size() - 1];
    }
};

上面是利用原来矩阵，会改变矩阵数据的方法

下面是不改变矩阵数据方法

class Solution {
public:
    int minPathSum(vector<vector<int> > &grid)
	{
		if (grid.empty()) return 0;

        vector<int> col(grid[0].size(), INT_MAX);
		col[0] = 0;
		for (int i = 0; i < grid.size(); i++)
		{
			col[0] += grid[i][0];
			for (int j = 1; j < grid[0].size(); j++)
			{
				col[j] = grid[i][j] + (col[j] > col[j - 1] ? col[j - 1] : col[j]);
			}
		}
		return col[grid[0].size() - 1];
	}
};