Leetcode 算法设计 第十三周

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?

题目大意

规定开始和结束的地点，只能向左或向右，求有多少条可能的路径

我的解答

class Solution {
public:
    int uniquePaths(int m, int n) {
        int map[m][n];
        for(int i = 0; i < m; i++){
            map[i][0] = 1;
        }
        for(int j = 0; j < n; j++){
            map[0][j] = 1;
        }
        for(int i = 1; ifor(int j = 1; jmap[i][j] = map[i-1][j]+map[i][j-1];
            }
        }
        return map[m-1][n-1];
    }
};