zoukankan      html  css  js  c++  java
  • leetcode--Unique Paths II

    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) {
            int path = 0;
            int row = obstacleGrid.length;
            if(row > 0){
            	int column = obstacleGrid[0].length;
            	int[][] paths = new int[row][column];
            	if(obstacleGrid[0][0] != 1){
            		paths[0][0] = 1;
            		for(int i = 1; i < row; ++i){
            			if(obstacleGrid[i][0] != 1)
            				paths[i][0] = paths[i - 1][0];
            			else
            				paths[i][0] = 0;
            		}
            		for(int i = 1; i < column; ++i){
            			if(obstacleGrid[0][i] != 1)
            				paths[0][i] = paths[0][i - 1];
            			else
            				paths[0][i] = 0;
            		}
            		
            		for(int i = 1; i < row; ++i){
            			for(int j = 1; j < column; ++j){
            				if(obstacleGrid[i][j] != 1)
                				paths[i][j] = paths[i - 1][j] + paths[i][j - 1];
                			else
                				paths[i][j] = 0;
            			}
            		}
            		path = paths[row - 1][column - 1];
            	}
            }
            return path;    
        }
    }
    

      

  • 相关阅读:
    Kubernetes的RBAC是啥
    《高效学习的七个习惯》总结
    Kubernetes的CronJob对象
    Kubernetes的Job对象
    什么是DaemonSet
    Docker容器日志路径
    什么是StatefulSet
    Kubernetes的Deployment对象使用
    MXNET:卷积神经网络基础
    MXNET:深度学习计算-GPU
  • 原文地址:https://www.cnblogs.com/averillzheng/p/3774551.html
Copyright © 2011-2022 走看看