algorithm/LeetCode-Go
1
0
Fork 0
mirror of https://github.com/halfrost/LeetCode-Go.git synced 2026-03-13 10:02:05 +08:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #137 from NovaHe/master

Browse Source 
clean up redundant code
This commit is contained in:
halfrost
2021-05-23 16:24:16 +08:00
committed by GitHub
parent 9dbefba7cd 58f6f7fedb
commit 851e0eaad5
2 changed files with 10 additions and 14 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
leetcode/0062.Unique-Paths/62. Unique Paths.go
View File

@@ -5,14 +5,12 @@ func uniquePaths(m int, n int) int {
for i := 0; i < n; i++ {
dp[i] = make([]int, m)
}
for i := 0; i < m; i++ {
dp[0][i] = 1
}
for i := 0; i < n; i++ {
dp[i][0] = 1
}
for i := 1; i < n; i++ {
for j := 1; j < m; j++ {
for j := 0; j < m; j++ {
if i == 0 || j == 0 {
dp[i][j] = 1
continue
}
dp[i][j] = dp[i-1][j] + dp[i][j-1]
}
}

12
website/content/ChapterFour/0001~0099/0062.Unique-Paths.md
View File

@@ -52,14 +52,12 @@ func uniquePaths(m int, n int) int {
for i := 0; i < n; i++ {
dp[i] = make([]int, m)
}
for i := 0; i < m; i++ {
dp[0][i] = 1
}
for i := 0; i < n; i++ {
dp[i][0] = 1
}
for i := 1; i < n; i++ {
for j := 1; j < m; j++ {
for j := 0; j < m; j++ {
if i == 0 || j == 0 {
dp[i][j] = 1
continue
}
dp[i][j] = dp[i-1][j] + dp[i][j-1]
}
}