[LeetCode] Unique Paths 起点与终点确定的路径数

声明：原题目转载自LeetCode，解答部分为原创

Problem ：

    A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below).

    The robot can only move either down or right at any point in time. The robot is trying to reach the bottom-right corner of the grid (marked 'Finish' in the diagram below).

    How many possible unique paths are there?

     Above is a 3 x 7 grid. How many possible unique paths are there?

    Note: m and n will be at most 100.

Solution：

    思路：动态规划，假定f（a， b）为从第a行第b列到目的地的路径数目，则状态转换方程为

     f（a， b） = f（a， b + 1） + f（a + 1， b）

    如图为m * n规格的图，开辟一个二维数组并初始化各位为0，且令f （m，n - 1） = 1.

    代码如下：

#include<iostream>
#include<vector>
using namespace std;

class Solution {
public:
    int uniquePaths(int m, int n) {
        vector<vector<int> > num_of_way(m + 1, vector<int>(n + 1));
        num_of_way[m][n - 1] = 1;
        for(int i = m - 1 ; i >= 0 ; i --)
        {
        	for(int j = n - 1 ; j >= 0 ; j --)
        	{
        		num_of_way[i][j] = num_of_way[i + 1][j] + num_of_way[i][j + 1];
			}
		}
		return num_of_way[0][0];
    }
};

int main()
{
	Solution text;
	cout << text.uniquePaths(3, 7) << endl;
	return 0;
}