[LeetCode] Unique Paths

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.

分析：参考资料http://blog.csdn.net/jiadebin890724/article/details/23302123

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

[LeetCode] Unique Paths

原文：http://www.cnblogs.com/vincently/p/4799236.html