代码随想录算法训练营第三十九天| LeetCode62.不同路径 63. 不同路径 II

最新推荐文章于 2024-05-20 15:29:54 发布

冰冰的coco

最新推荐文章于 2024-05-20 15:29:54 发布

阅读量552

点赞数

分类专栏：代码随想录算法训练营文章标签： c++ leetcode 算法

本文链接：https://blog.csdn.net/qq_44144025/article/details/127581392

版权

代码随想录算法训练营专栏收录该内容

52 篇文章 0 订阅

订阅专栏

62.不同路径

题目：力扣

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

63. 不同路径 II

题目：力扣

class Solution {
public:
    int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid) {
        if(obstacleGrid[0][0] == 1) return 0;
        int m = obstacleGrid.size();
        int n = obstacleGrid[0].size();
        vector<vector<int> > ans(m+1,vector(n+1,0));

        for(int i = 1; i <= m; ++i){
            for(int j = 1; j <= n; ++j){
                if(i == 1 && j == 1){
                    ans[i][j] = 1;
                    continue;
                }
                if(obstacleGrid[i-1][j-1] == 1) {
                    ans[i][j] = 0;
                    continue;
                }else{
                    ans[i][j] = ans[i-1][j] + ans[i][j-1];
                }
            }
        }
        for(int i = 0; i < ans.size(); ++i){
            for(int j = 0; j < ans[0].size(); ++j){
                cout << ans[i][j] ;
            }
            cout << endl;
            
        }
        return ans[m][n];
    }
    
};

//不在外圈加0
class Solution {
public:
    int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid) {
        int m = obstacleGrid.size();
        int n = obstacleGrid[0].size();
	if (obstacleGrid[m - 1][n - 1] == 1 || obstacleGrid[0][0] == 1) //如果在起点或终点出现了障碍，直接返回0
            return 0;
        vector<vector<int>> dp(m, vector<int>(n, 0));
        for (int i = 0; i < m && obstacleGrid[i][0] == 0; i++) dp[i][0] = 1;
        for (int j = 0; j < n && obstacleGrid[0][j] == 0; j++) dp[0][j] = 1;
        for (int i = 1; i < m; i++) {
            for (int j = 1; j < n; j++) {
                if (obstacleGrid[i][j] == 1) continue;
                dp[i][j] = dp[i - 1][j] + dp[i][j - 1];
            }
        }
        return dp[m - 1][n - 1];
    }
};