LeetCode:62. Unique Paths

最近在了解动态规划，上Leetcode找一下题目来做。

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?

AC：

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