leetcode Unique Paths && Unique Paths

最新推荐文章于 2024-08-01 10:14:57 发布

piyalo

最新推荐文章于 2024-08-01 10:14:57 发布

阅读量163

点赞数

分类专栏： leetcode，DP 文章标签： C++ leetcode

本文链接：https://blog.csdn.net/qq_33755214/article/details/78577061

版权

leetcode，DP 专栏收录该内容

8 篇文章 0 订阅

订阅专栏

Desciption:

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.

DP方程：

res[i][j] = 1 i = 0 || j = 0

res[i-1][j] + res[i][j-1] i ,j >0

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

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

Desciption:

Unique Paths 2;

Follow up for "Unique Paths":

Now consider if some obstacles are added to the grids. How many unique paths would there be?

An obstacle and empty space is marked as 1 and 0 respectively in the grid.

For example,

There is one obstacle in the middle of a 3x3 grid as illustrated below.

[
  [0,0,0],
  [0,1,0],
  [0,0,0]
]

The total number of unique paths is 2.

Note: m and n will be at most 100.

注意到 DP方程还是一样，但是当矩阵[M][N] = 1时， res[M][N] = 0;

class Solution {
public:
    int uniquePathsWithObstacles(vector<vector<int> > &obstacleGrid) {
        int m = obstacleGrid.size() , n = obstacleGrid[0].size();
        vector<vector<int>> dp(m+1,vector<int>(n+1,0));
        dp[0][1] = 1;
        for(int i = 1 ; i <= m ; ++i)
            for(int j = 1 ; j <= n ; ++j)
                if(!obstacleGrid[i-1][j-1])
                    dp[i][j] = dp[i-1][j]+dp[i][j-1];
        return dp[m][n];
    }
};