给定一个 32 位有符号整数，将整数中的数字进行反转。
转载
2021-08-13 13:57:28
139阅读
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 p
转载
2019-09-20 02:22:00
60阅读
2评论
上题会做，这题就会做吧，只要把障碍物的地方的map值设置为0，以及一开始的遍历注意一下就可以了class Solution {public: int map[100][100]; int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid) { int m=obstacleG
原创
2023-01-11 12:11:28
50阅读
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 bo...
转载
2018-11-06 08:06:00
100阅读
2评论
Follow up for "Unique Paths":Now consider if some obstacles are added to the grids. How many
原创
2022-12-01 19:26:19
33阅读
Follow up for “Unique Paths”:Now consider if some o
原创
2022-08-03 17:11:44
38阅读
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 p
转载
2018-10-21 13:40:00
37阅读
2评论
63. **Unique Paths IIhttps://leetcode.com/problems/unique-paths-ii/descri
原创
2022-05-30 11:17:14
26阅读
题目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
原创
2023-03-07 12:47:41
70阅读
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
转载
2016-08-03 16:00:00
33阅读
2评论
getters 是用来存放state更换后的状态的，是用来定义函数的，目前我知道的 : 每个函数都有两个参数，第一个是state，第二个是本身getters 【多一个都不行的 ！】。 案例：我state中有一个num是9，有几个组件想取num的平方，如果直接修改是不可观的，因为有些取有想对它做其他操
原创
2022-05-31 18:27:18
545阅读
Follow up for "Unique Paths":
原创
2023-09-05 09:18:50
40阅读
一个机器人位于一个 m x n 网格的左上角 （起始点在下图中标记为“Start” ）。机器人每次只能向下或者向右移动一步。机器人试图达到
原创
2023-03-03 00:00:50
48阅读
###解题思路在62题的基础上加上了判断每一个格子能不能走还是62题的做法,把不能走的格子置为0即可###代码
原创
2023-05-18 14:17:42
12阅读
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 p
转载
2019-09-13 23:04:00
49阅读
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 p
转载
2020-03-23 12:25:00
103阅读
2评论
63.不同路径Ⅱ 题目 一个机器人位于一个 m x n 网格的左上角 （起始点在下图中标记为“Start” ）。 机器人每次只能向下或者向右移动一步。机器人试图达到网格的右下角（在下图中标记为“Finish”）。 现在考虑网格中有障碍物。那么从左上角到右下角将会有多少条不同的路径？ 网格中的障碍物和 ...
转载
2021-08-25 20:59:00
181阅读
2评论
