leetcode 23 不同路径2

最新推荐文章于 2022-04-03 19:24:49 发布

循环是人递归是神

最新推荐文章于 2022-04-03 19:24:49 发布

阅读量78

点赞数

分类专栏： Leetcode

本文链接：https://blog.csdn.net/qq_35752161/article/details/104309773

版权

Leetcode 专栏收录该内容

67 篇文章 0 订阅

订阅专栏

dfs + 打表过不了，只能动态规划

int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid) {
        if (!obstacleGrid.size() || !obstacleGrid[0].size()) 
            return 0;
        int rows = obstacleGrid.size(), cols = obstacleGrid[0].size();
        vector<vector<long long>> dp(rows, vector<long long>(cols, 0));
        if (obstacleGrid[0][0] == 1) 
            return 0;
        for (int i = 0; i < rows; i++)
        {
            for (int j = 0; j < cols; j++)
            {
                if (obstacleGrid[i][j] == 1) 
                    continue;
                if (i == 0 && j == 0)
                    dp[0][0] = 1;
                else if (i == 0)
                    dp[i][j] = dp[i][j - 1];
                else if (j == 0)
                    dp[i][j] = dp[i - 1][j];
                else
                    dp[i][j] = dp[i][j - 1] + dp[i - 1][j];
            }
        }
        return dp[rows - 1][cols - 1];
    }