LeetCode 62 - Unique Paths

最新推荐文章于 2020-08-14 22:01:41 发布

EnjoyCodingAndGame

最新推荐文章于 2020-08-14 22:01:41 发布

阅读量344

点赞数

分类专栏：编程题目文章标签： LeetCode

本文链接：https://blog.csdn.net/ywcpig/article/details/51065877

版权

编程题目专栏收录该内容

78 篇文章 1 订阅

订阅专栏

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.

My Code

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

        return grid[m-1][n-1];
    }
};

Runtime: 0 ms