62. Unique Paths

最新推荐文章于 2022-12-17 10:35:17 发布

斯大分

最新推荐文章于 2022-12-17 10:35:17 发布

阅读量113

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/qq_27655147/article/details/79356163

版权

leetcode 专栏收录该内容

22 篇文章 0 订阅

订阅专栏

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.

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