Leetcode - Unique Paths

题目链接

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?

Leetcode - Unique Paths_第1张图片
题目示例

Above is a 3 x 7 grid. How many possible unique paths are there?
Note: m and n will be at most 100.

解题思路

TODO (稍后补充)

解题代码

class Solution {
public:
    int uniquePaths(int m, int n) {
        if(m<=0 || n<=0) return 0;
        vector > paths(m, vector(n, 0));
        
        for(int i=0;i

你可能感兴趣的:(Leetcode - Unique Paths)