leetcode—— 62——Unique Paths

最新推荐文章于 2025-09-06 17:22:57 发布

原创最新推荐文章于 2025-09-06 17:22:57 发布 · 196 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #算法题

leetcode 专栏收录该内容

277 篇文章

订阅专栏

本文探讨了机器人在3x7网格中从左上角到右下角的唯一路径计数问题，通过动态规划算法解决路径计算。

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> > path(m, vector<int>(n, 1));
        for(int i = 1; i < m; i ++)
        {
            for(int j = 1; j < n; j ++)
            {
                path[i][j] = path[i-1][j] + path[i][j-1];
            }
        }
        return path[m-1][n-1];

    }

};