mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-09 19:44:45 +08:00
Merge pull request #1279 from Frankheartusf/master
更新了0045 跳跃游戏II golang代码
This commit is contained in:
@ -218,18 +218,26 @@ class Solution:
|
|||||||
```Go
|
```Go
|
||||||
func jump(nums []int) int {
|
func jump(nums []int) int {
|
||||||
dp := make([]int, len(nums))
|
dp := make([]int, len(nums))
|
||||||
dp[0]=0
|
dp[0] = 0//初始第一格跳跃数一定为0
|
||||||
|
|
||||||
for i := 1; i < len(nums); i++ {
|
for i := 1; i < len(nums); i++ {
|
||||||
dp[i] = i
|
dp[i] = i
|
||||||
for j := 0; j < i; j++ {
|
for j := 0; j < i; j++ {
|
||||||
if nums[j]+j>i{
|
if nums[j] + j >= i {//nums[j]为起点,j为往右跳的覆盖范围,这行表示从j能跳到i
|
||||||
dp[i]=min(dp[j]+1,dp[i])
|
dp[i] = min(dp[j] + 1, dp[i])//更新最小能到i的跳跃次数
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
return dp[len(nums)-1]
|
return dp[len(nums)-1]
|
||||||
}
|
}
|
||||||
|
|
||||||
|
func min(a, b int) int {
|
||||||
|
if a < b {
|
||||||
|
return a
|
||||||
|
} else {
|
||||||
|
return b
|
||||||
|
}
|
||||||
|
}
|
||||||
```
|
```
|
||||||
|
|
||||||
### Javascript
|
### Javascript
|
||||||
|
Reference in New Issue
Block a user