leecode 解题总结：64. Minimum Path Sum

#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
/*
问题:
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[i][j]表示到达网格(i,j)位置时元素和的最小值，那么必然有，设网格为A
dp[i][j]= min{ dp[i-1][j] , dp[i][j-1] } + A[i][j]
边界值是;dp[0][0] = A[0][0]，对于第一行dp[0][j] = 对 A[0][j]累加求和，其中j属于[0, j]。同一列也是
目标值是:dp[row-1][col-1]

输入:
3(行数) 3(列数)
0 3 2
2 1 5
1 4 0

1 3
0 1 0

1 1 
1
输出:
7
1
1
*/

class Solution {
public:
    int minPathSum(vector<vector<int>>& grid) {
        if(grid.empty())
		{
			return 0;
		}
		int row = grid.size();
		int col = grid.at(0).size();
		vector< vector<int> > paths(row , vector<int>(col , 0));
		//初始化第一行，每个元素等于累加求和
		int sum = 0;
		for(int i = 0 ; i < col ; i++)
		{
			sum += grid.at(0).at(i);
			paths.at(0).at(i) = sum;
		}
		//初始化第一列
		sum = 0;
		for(int i = 0 ; i < row ; i++)
		{
			sum += grid.at(i).at(0);
			paths.at(i).at(0) = sum;
		}
		//递推
		for(int i = 1 ; i <  row ; i++)
		{
			for(int j = 1 ; j < col ; j++)
			{
				paths.at(i).at(j) = min(paths.at(i-1).at(j) , paths.at(i).at(j-1) ) + grid.at(i).at(j);
			}
		}
		return paths.at(row - 1).at(col - 1);
    }
};

void process()
{
	 vector< vector<int> > nums;
	 int value;
	 int row;
	 int col;
	 Solution solution;
	 while(cin >> row >> col)
	 {
		 nums.clear();
		 for(int i = 0 ; i < row ; i++)
		 {
			 vector<int> num;
			 for(int j = 0 ; j < col; j++)
			 {
				 cin >> value;
				 num.push_back(value); 
			 }
			 nums.push_back(num);
		 }
		 int result = solution.minPathSum(nums);
		 cout << result << endl;
	 }
}

int main(int argc , char* argv[])
{
	process();
	getchar();
	return 0;
}