62. 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.

解答：
设s[i][j] 为从起点到（i,j）位置处的路径数。
第一行，第一列都为1，
到其他位置处（i,j）：到达位置（i,j）只能从上面或者左面过来，因此状态转移方程为：s[i][j] = s[i-1][j] + s[i][j-1]
复杂度为O(n^2)

class Solution {
public:
    int uniquePaths(int m, int n) {
        int res[100][100];
        for (int i = 0; i < m; ++i) {  // 第i行第j列
            for (int j = 0; j < n; ++j) {
                if (i == 0 || j == 0) {
                    res[i][j] = 1;
                }
                else {
                    res[i][j] = res[i - 1][j] + res[i][j - 1]; // 上 + 左
                }
            }
        }
        return res[m - 1][n - 1];
    }
};

参考博客：
http://blog.csdn.net/sunnyyoona/article/details/43458319