zoukankan      html  css  js  c++  java
  • leetcode

    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.

    class Solution {
    public:
        int uniquePathsWithObstacles(std::vector<std::vector<int> > &obstacleGrid) {
            std::vector<std::vector<int>> dp(obstacleGrid.size(),std::vector<int>(obstacleGrid[0].size(),0));
    		dp[0][0] = obstacleGrid[0][0] ? 0 : 1;
    		for (int i = 1; i < obstacleGrid.size(); i++)
    		{
    			dp[i][0] = obstacleGrid[i][0] ? 0 : dp[i-1][0];
    		}
    		for (int i = 1; i < obstacleGrid[0].size(); i++)
    		{
    			dp[0][i] = obstacleGrid[0][i] ? 0 : dp[0][i-1];
    		}
    		for (int i = 1; i < obstacleGrid.size(); i++)
    		{
    			for (int j = 1; j < obstacleGrid[0].size(); j++)
    			{
    				dp[i][j] = obstacleGrid[i][j] ? 0 : dp[i-1][j] + dp[i][j-1];
    			}
    		}
    		return dp[obstacleGrid.size()-1][obstacleGrid[0].size()-1];
        }
    };


    版权声明:本文博客原创文章,博客,未经同意,不得转载。

  • 相关阅读:
    Zuul的核心源码解析
    基于Sentinel的服务保护
    Sentinel
    windows进行配置转发
    Hystrix断路器
    服务熔断Hystrix高级
    微服务架构的高并发问题
    Feign的高级配置
    倒排序原理和实例
    云计算技术的产生、概念、原理、应用和前景
  • 原文地址:https://www.cnblogs.com/mfrbuaa/p/4713938.html
Copyright © 2011-2022 走看看