62 Unique Paths

1 题目

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 7 x 3 grid. How many possible unique paths are there?

Note: m and n will be at most 100.

2 尝试解

class Solution {
public:
    int uniquePaths(int m, int n) {
        if(m*n == 0) return 0;
        map<vector<int>,int> path;  //save the path tried
        return savePath(m,n,path);
    }
    int savePath(int m, int n, map<vector<int>,int>& path){
        if(m == 1 || n == 1){
            return 1;
        }
        else if(path.count(vector<int> {m,n}) != 0){
            return path[vector<int> {m,n}];
        }
        else{
            int path_count = savePath(m-1,n,path)+savePath(m,n-1,path);
            path[vector<int> {m,n}] = path_count;
            return path_count;
        }
    }
};

3 标准解

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