Unique Paths II

最新推荐文章于 2024-04-01 00:43:20 发布

liujunlovecs

最新推荐文章于 2024-04-01 00:43:20 发布

阅读量270

点赞数

分类专栏：刷题 Leetcode 文章标签： Array DP

本文链接：https://blog.csdn.net/liujunlovecs/article/details/46481753

版权

刷题同时被 2 个专栏收录

199 篇文章 0 订阅

订阅专栏

Leetcode

198 篇文章 0 订阅

订阅专栏

public class Solution {
    public int uniquePathsWithObstacles(int[][] obstacleGrid) {
        if (obstacleGrid == null || obstacleGrid.length == 0 || obstacleGrid[0].length == 0) {
            return 0;
        }
        int row = obstacleGrid.length;
        int col = obstacleGrid[0].length;
        int[][] paths = new int[row][col];
        for (int i = 0; i < row; i++) {
            if (obstacleGrid[i][0] != 1) {
                paths[i][0] = 1;
            } else {
                break;
            }
        }
        for (int j = 0; j < col; j++) {
            if (obstacleGrid[0][j] != 1) {
                paths[0][j] = 1;
            } else {
                break;
            }
        }
        for (int i = 1; i < row; i++) {
            for (int j = 1; j < col; j++) {
                if (obstacleGrid[i][j] == 1) {
                    paths[i][j] = 0;
                } else {
                    paths[i][j] = paths[i - 1][j] + paths[i][j - 1];
                }
            }
        }
        return paths[row - 1][col - 1];
    }
}