zoukankan      html  css  js  c++  java
  • 19.2.11 [LeetCode 63] Unique Paths II

    A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below).

    The robot can only move either down or right at any point in time. The robot is trying to reach the bottom-right corner of the grid (marked 'Finish' in the diagram below).

    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.

    Note: m and n will be at most 100.

    Example 1:

    Input:
    [
      [0,0,0],
      [0,1,0],
      [0,0,0]
    ]
    Output: 2
    Explanation:
    There is one obstacle in the middle of the 3x3 grid above.
    There are two ways to reach the bottom-right corner:
    1. Right -> Right -> Down -> Down
    2. Down -> Down -> Right -> Right
     1 class Solution {
     2 public:
     3     int caluniquePaths(vector<vector<int>>&obstacleGrid,vector<vector<int>>&mark,int m, int n) {
     4         int down = 0, right = 0;
     5         if (mark[m][n] != -1)return mark[m][n];
     6         int orim = obstacleGrid.size(), orin = obstacleGrid[0].size();
     7         if (obstacleGrid[orim-m][orin-n] == 1) {
     8             mark[m][n] = 0;
     9             return 0;
    10         }
    11         if (m > 1)
    12             down = caluniquePaths(obstacleGrid,mark, m - 1, n);
    13         if (n > 1)
    14             right = caluniquePaths(obstacleGrid,mark, m, n - 1);
    15         mark[m][n] = down + right;
    16         return mark[m][n];
    17     }
    18     int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid) {
    19         int m = obstacleGrid.size(), n = obstacleGrid[0].size();
    20         vector<vector<int>>mark(m+1, vector<int>(n+1, -1));
    21         mark[1][1] = !obstacleGrid[m-1][n-1];
    22         return caluniquePaths(obstacleGrid,mark, m, n);
    23     }
    24 };
    View Code
  • 相关阅读:
    02.零成本实现WEB性能测试-基于APACHE JMETER
    Apache JMeter--网站自动测试与性能测评
    01.天幕红尘
    php-fpm介绍及配置
    Linux环境下搭建php开发环境的操作步骤
    Linux下PHP开发环境搭建
    nginx 502 Bad Gateway 错误问题收集
    Nginx配置文件详细说明
    Linux下查看MySQL的安装路径
    LINUX下YUM源配置
  • 原文地址:https://www.cnblogs.com/yalphait/p/10361082.html
Copyright © 2011-2022 走看看