Day39(62, 63)

最新推荐文章于 2024-09-16 06:54:08 发布

MicroYui

最新推荐文章于 2024-09-16 06:54:08 发布

阅读量60

点赞数

分类专栏： leetcode刷题文章标签： leetcode 算法

本文链接：https://blog.csdn.net/HITyingcai/article/details/129763075

版权

leetcode刷题专栏收录该内容

51 篇文章 0 订阅

订阅专栏

62. Unique Paths

There is a robot on an m x n grid. The robot is initially located at the top-left corner (i.e., grid[0][0]). The robot tries to move to the bottom-right corner (i.e., grid[m - 1][n - 1]). The robot can only move either down or right at any point in time.

Given the two integers m and n, return the number of possible unique paths that the robot can take to reach the bottom-right corner.

The test cases are generated so that the answer will be less than or equal to 2 * 109.

Example 1:

Input: m = 3, n = 7
Output: 28

Example 2:

Input: m = 3, n = 2
Output: 3
Explanation: From the top-left corner, there are a total of 3 ways to reach the bottom-right corner:

Right -> Down -> Down
Down -> Down -> Right
Down -> Right -> Down

class Solution {  
    public int uniquePaths(int m, int n) {  
        int[][] dp = new int[m][n];  
        for (int i = 0; i < n; i++) dp[0][i] = 1;  
        for (int i = 0; i < m; i++) dp[i][0] = 1;  
        for (int column = 1; column < n; column++) {  
            for (int row = 1; row < m; row++) {  
                dp[row][column] = dp[row-1][column] + dp[row][column-1];  
            }  
        }  
        return dp[m-1][n-1];  
    }  
}

63. Unique Paths II

You are given an m x n integer array grid. There is a robot initially located at the top-left corner (i.e., grid[0][0]). The robot tries to move to the bottom-right corner (i.e., grid[m - 1][n - 1]). The robot can only move either down or right at any point in time.

An obstacle and space are marked as 1 or 0 respectively in grid. A path that the robot takes cannot include any square that is an obstacle.

Return the number of possible unique paths that the robot can take to reach the bottom-right corner.

The testcases are generated so that the answer will be less than or equal to 2 * 109.

Example 1:

Input: obstacleGrid = [[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:

Right -> Right -> Down -> Down
Down -> Down -> Right -> Right

Example 2:

Input: obstacleGrid = [[0,1],[0,0]]
Output: 1

class Solution {  
    public int uniquePathsWithObstacles(int[][] obstacleGrid) {  
        int m = obstacleGrid.length;  
        int n = obstacleGrid[0].length;  
        if (m == 1 && n == 1 && obstacleGrid[0][0] == 0) return 1;  
        int[][] dp = new int[m][n];  
        for (int i = 0; i < m; i++) {  
            if (obstacleGrid[i][0] != 1) dp[i][0] = 1;  
            else break;  
        }  
        for (int i = 0; i < n; i++) {  
            if (obstacleGrid[0][i] != 1) dp[0][i] = 1;  
            else break;  
        }  
        for (int row = 1; row < m; row++) {  
            for (int column = 1; column < n; column++) {  
                if (obstacleGrid[row][column] == 1) dp[row][column] = 0;  
                else dp[row][column] = dp[row-1][column] + dp[row][column-1];  
            }  
        }  
        return dp[m-1][n-1];  
    }  
}