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.

每个格子的路径 step[i][j]=step[i-1][j]+step[i][j-1];

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