zoukankan      html  css  js  c++  java
  • leetcode[63]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.

    class Solution {
    public:
    int uniquePathsWithObstacles(vector<vector<int> > &obstacleGrid) 
    {
        int m=obstacleGrid.size();
        int n=obstacleGrid[0].size();
        vector<int> ivec(n);
        vector<vector<int>> f(m, ivec);
        f[0][0]=obstacleGrid[0][0]==1?0:1;
        for (int ki=1;ki<m;ki++)
        {
            f[ki][0]=obstacleGrid[ki][0]==1?0:f[ki-1][0];
        }
        for (int kj=1;kj<n;kj++)
        {
            f[0][kj]=obstacleGrid[0][kj]==1?0:f[0][kj-1];
        }
        for (int i=1;i<m;i++)
        {
            for (int j=1;j<n;j++)
            {
                f[i][j]=obstacleGrid[i][j]==1?0:f[i-1][j]+f[i][j-1];
            }
        }
        return f[m-1][n-1];
    }
    };
  • 相关阅读:
    jQuery动画(带参数)
    ajax是什么
    jQuery遍历(3)
    jQuery遍历(2)
    jQuery遍历(1)
    javascript错误处理
    导航菜单的实现
    bootstrap环境搭建
    jQuery动画效果
    MVVM模式下WPF动态绑定展示图片
  • 原文地址:https://www.cnblogs.com/Vae1990Silence/p/4281505.html
Copyright © 2011-2022 走看看