Skip to content
Navigation Menu
Sign in
Products
Platform
GitHub
Repository hosting, code review, and collaboration
Copilot
AI coding agent for tasks, projects, and automated work
Build & Ship
Actions
CI/CD and automation
Code Quality
Quality analysis, fixes, and enforcement
Codespaces
Cloud development environments
Secure
Code Security
Vulnerability detection and remediation
Secret Protection
Secret scanning and leak prevention
All Features
Developers
Learn
Documentation
Training
Certifications
Build
Build with Copilot
Customize Copilot
Integrations
Explore
Trending repos
GitHub Sponsors
Developer articles
Changelog
Changelog
Your source for the latest features, improvements, and fixes across GitHub products, all in one place.
Businesses
By Stage
Enterprises
Team
Startups
Nonprofits
By Industry
Healthcare
Financial services
Manufacturing
Government
See all industries
Evaluate GitHub
Why GitHub
Customer Stories
Business insights
Trust Center
Add-ons
GitHub Advanced Security
Enterprise-grade code security
Copilot for business
Enterprise-grade AI features
Premium Support
Enterprise-grade 24/7 support
Resources
Learn & Connect
Documentation
Resource center
Blog
Events & webinars
Community Forum
Customer Stories
Integrations
Support
Customer support
Training
GitHub Status
Company
About
Partners
Changelog
GitHub Universe
GitHub Universe
The event for developers, by developers — talks, workshops, and what’s next for GitHub.
Pricing
Search
/
Sign in
Sign up
Appearance settings
You signed in with another tab or window.
Reload
to refresh your session.
You signed out in another tab or window.
Reload
to refresh your session.
You switched accounts on another tab or window.
Reload
to refresh your session.
Dismiss alert
{{ message }}
AhkunTa
Arithmetic
Repository navigation
Code
Issues
Pull requests
Actions
Projects
Security and quality
Insights
More
items
Files
Expand file tree
master
Breadcrumbs
Arithmetic
/
LeetCode
/
63_javascript.js
Copy path
Blame
More file actions
Blame
More file actions
Latest commit
History
History
History
67 lines (58 loc) · 1.88 KB
master
Breadcrumbs
Arithmetic
/
LeetCode
/
63_javascript.js
Copy path
Top
File metadata and controls
Code
Blame
67 lines (58 loc) · 1.88 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
// 一个机器人位于一个 m x n 网格的左上角 (起始点在下图中标记为“Start” )。
// 机器人每次只能向下或者向右移动一步。机器人试图达到网格的右下角(在下图中标记为“Finish”)。
// 现在考虑网格中有障碍物。那么从左上角到右下角将会有多少条不同的路径?
// 网格中的障碍物和空位置分别用 1 和 0 来表示。
// 说明:m 和 n 的值均不超过 100。
// 示例 1:
// 输入:
// [
// [0,0,0],
// [0,1,0],
// [0,0,0]
// ]
// 输出: 2
// 解释:
// 3x3 网格的正中间有一个障碍物。
// 从左上角到右下角一共有 2 条不同的路径:
// 1. 向右 -> 向右 -> 向下 -> 向下
// 2. 向下 -> 向下 -> 向右 -> 向右
// 1 动态规划
// 状态转移方程 同 #62题不同的是当
// obstacleGrid[i][j] == 1 即有障碍时 dp[i][j] = 0 即不通过
// dp[i][j] = dp[i-1][j] + dp[i][j-1];
var uniquePathsWithObstacles = function (obstacleGrid) {
let row = obstacleGrid.length;
let column = obstacleGrid[0].length;
let dp = Array.from(new Array(row), () => new Array(column).fill(0));
// 放起点 和放终点的情况
if (obstacleGrid[0][0] == 1) return 0;
if (obstacleGrid[row - 1][column - 1] == 1) return 0;
// 当在第一列时,只要中间存在障碍,之后列上的都是 0
for (let i = 0; i < column; i++) {
if (obstacleGrid[0][i] == 1) {
dp[0][i] = 0;
break;
} else {
dp[0][i] = 1;
}
}
// 第一行同第一列类似
for (let j = 0; j < row; j++) {
if (obstacleGrid[j][0] == 1) {
dp[j][0] = 0;
break;
} else {
dp[j][0] = 1;
}
}
for (let i = 1; i < row; i++) {
for (let j = 1; j < column; j++) {
if (obstacleGrid[i][j]) {
dp[i][j] = 0;
} else {
dp[i][j] = dp[i - 1][j] + dp[i][j - 1];
}
}
}
return dp[row - 1][column - 1];
};
You can’t perform that action at this time.