Skip to content

Commit 337cac6

JalanJiang JalanJiang

committed

🧙‍♂️(greedy): 修该 45 题题解格式

1 parent cecabe6 commit 337cac6Copy full SHA for 337cac6

File tree

1 file changed

+20

-2

lines changed

docs/algorithm/greedy
- README.md

1 file changed

+20

-2

lines changed

`‎docs/algorithm/greedy/README.md‎`

Lines changed: 20 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -15,14 +15,32 @@ dp[x] = min(dp[n1], dp[n2], ..., dp[nx]) + 1`
`15`	`15`	```
`16`	`16`
`17`	`17`	```python
`18`		`-`
	`18`	`+class Solution(object):`
	`19`	`+ def jump(self, nums):`
	`20`	`+ """`
	`21`	`+ :type nums: List[int]`
	`22`	`+ :rtype: int`
	`23`	`+ """`
	`24`	`+ length = len(nums)`
	`25`	`+ dp = [0 for _ in range(length)]`
	`26`	`+`
	`27`	`+ for i in range(length):`
	`28`	`+ num = nums[i]`
	`29`	`+ for j in range(1, num + 1):`
	`30`	`+ if i + j < length:`
	`31`	`+ if dp[i + j] == 0:`
	`32`	`+ dp[i + j] = dp[i] + 1`
	`33`	`+ else:`
	`34`	`+ dp[i + j] = min(dp[i] + 1, dp[i + j])`
	`35`	`+`
	`36`	`+ return dp[length - 1]`
`19`	`37`	```
`20`	`38`
`21`	`39`	`### 解法二:贪心`
`22`	`40`
`23`	`41`	`主要思想:每次都要跳到能跳到更远位置的点上。`
`24`	`42`
`25`		-```
	`43`	+```python
`26`	`44`	`class Solution(object):`
`27`	`45`	`def jump(self, nums):`
`28`	`46`	`"""`

0 commit comments

Comments

(0)