Leetcode 63. Unique Paths II (Medium) (java)

来源：互联网发布：python 键盘控制程序编辑：程序博客网时间：2024/06/05 05:34

Tag: Array, Dynamic Programming

Difficulty: Medium

/*63. Unique Paths II (Medium)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.*/public class Solution {    public int uniquePathsWithObstacles(int[][] obstacleGrid) {        if (obstacleGrid == null || obstacleGrid.length == 0) {            return 0;        }        int _size = obstacleGrid[0].length;        int[] res = new int[_size];        res[0] = 1;        for (int i = 0; i < obstacleGrid.length; i++) {            for (int j = 0; j < _size; j++) {                if (obstacleGrid[i][j] == 1) {                    res[j] = 0;                } else if (j > 0) {                    res[j] = res[j] + res[j - 1];                }            }        }        return res[_size - 1];    }}

0 0