Commit 3d62b4a

committed

commit solution 55

1 parent c09563d commit 3d62b4aCopy full SHA for 3d62b4a

File tree

+45

-6

lines changed

+45

-6

lines changed

Lines changed: 17 additions & 4 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,7 +1,7 @@`
`1`	`1`	`# [55. 跳跃游戏](https://leetcode-cn.com/problems/jump-game)`
`2`	`2`
`3`	`3`	`### 题目描述`
`4`		`-<!-- 这里写题目描述 -->`
	`4`	`+`
`5`	`5`	`<p>给定一个非负整数数组,你最初位于数组的第一个位置。</p>`
`6`	`6`
`7`	`7`	`<p>数组中的每个元素代表你在该位置可以跳跃的最大长度。</p>`
`@@ -26,15 +26,28 @@`
`26`	`26`
`27`	`27`	`### 解题思路`
`28`	`28`
	`29`	`+1. 贪心算法`
`29`	`30`
`30`	`31`	`### 具体解法`
`31`	`32`
`32`		`-<!-- tabs:start -->`
`33`	`33`
`34`	`34`	`#### Golang`
`35`	`35`	```go
`36`		`-`
	`36`	`+func canJump(nums []int) bool {`
	`37`	`+ if len(nums) == 0 {`
	`38`	`+ return false`
	`39`	`+ }`
	`40`	`+ max := 0`
	`41`	`+ for i := 0; i <= max; i++ {`
	`42`	`+ if i+nums[i] > max {`
	`43`	`+ max = i + nums[i]`
	`44`	`+ }`
	`45`	`+ if max >= len(nums)-1 {`
	`46`	`+ return true`
	`47`	`+ }`
	`48`	`+ }`
	`49`	`+ return false`
	`50`	`+}`
`37`	`51`	```
`38`	`52`
`39`		`-<!-- tabs:end -->`
`40`	`53`

Lines changed: 26 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,26 @@`
	`1`	`+package leetcode`
	`2`	`+`
	`3`	`+/*`
	`4`	`+ * @lc app=leetcode.cn id=55 lang=golang`
	`5`	`+ *`
	`6`	`+ * [55] 跳跃游戏`
	`7`	`+ */`
	`8`	`+`
	`9`	`+// @lc code=start`
	`10`	`+func canJump(nums []int) bool {`
	`11`	`+ if len(nums) == 0 {`
	`12`	`+ return false`
	`13`	`+ }`
	`14`	`+ max := 0`
	`15`	`+ for i := 0; i <= max; i++ {`
	`16`	`+ if i+nums[i] > max {`
	`17`	`+ max = i + nums[i]`
	`18`	`+ }`
	`19`	`+ if max >= len(nums)-1 {`
	`20`	`+ return true`
	`21`	`+ }`
	`22`	`+ }`
	`23`	`+ return false`
	`24`	`+}`
	`25`	`+`
	`26`	`+// @lc code=end`

Lines changed: 2 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -8,7 +8,7 @@`
`8`	`8`	`- [1 - 99题](index-tags.md)`
`9`	`9`	`- [1. 两数之和 ✅](solution/1-99/0001.two-sum/)`
`10`	`10`	`- [2. 两数相加 ✅](solution/1-99/0002.add-two-numbers/)`
`11`		`- - [3. 无重复字符的最长子串](solution/1-99/0003.longest-substring-without-repeating-characters/)`
	`11`	`+ - [3. 无重复字符的最长子串 ✅](solution/1-99/0003.longest-substring-without-repeating-characters/)`
`12`	`12`	`- [4. 寻找两个有序数组的中位数](solution/1-99/0004.median-of-two-sorted-arrays/)`
`13`	`13`	`- [5. 最长回文子串](solution/1-99/0005.longest-palindromic-substring/)`
`14`	`14`	`- [6. z 字形变换](solution/1-99/0006.zigzag-conversion/)`
`@@ -60,7 +60,7 @@`
`60`	`60`	`- [52. n皇后 ii](solution/1-99/0052.n-queens-ii/)`
`61`	`61`	`- [53. 最大子序和 ✅](solution/1-99/0053.maximum-subarray/)`
`62`	`62`	`- [54. 螺旋矩阵](solution/1-99/0054.spiral-matrix/)`
`63`		`- - [55. 跳跃游戏](solution/1-99/0055.jump-game/)`
	`63`	`+ - [55. 跳跃游戏 ✅](solution/1-99/0055.jump-game/)`
`64`	`64`	`- [56. 合并区间 ✅](solution/1-99/0056.merge-intervals/)`
`65`	`65`	`- [57. 插入区间](solution/1-99/0057.insert-interval/)`
`66`	`66`	`- [58. 最后一个单词的长度 ✅](solution/1-99/0058.length-of-last-word/)`

Comments

(0)