Merge pull request #1662 from Galaxies2580/master

给0055. 跳跃游戏添加了go的贪心方法
This commit is contained in:
程序员Carl
2022-09-30 10:18:09 +08:00
committed by GitHub
4 changed files with 157 additions and 0 deletions

View File

@ -214,7 +214,26 @@ class Solution:
return ans
```
```python
# 贪心版本二
class Solution:
def jump(self, nums: List[int]) -> int:
if len(nums) == 1:
return 0
curDistance, nextDistance = 0, 0
step = 0
for i in range(len(nums)-1):
nextDistance = max(nextDistance, nums[i]+i)
if i == curDistance:
curDistance = nextDistance
step += 1
return step
```
### Go
```Go
func jump(nums []int) int {
dp := make([]int, len(nums))
@ -240,7 +259,71 @@ func min(a, b int) int {
}
```
```go
// 贪心版本一
func jump(nums []int) int {
n := len(nums)
if n == 1 {
return 0
}
cur, next := 0, 0
step := 0
for i := 0; i < n; i++ {
next = max(nums[i]+i, next)
if i == cur {
if cur != n-1 {
step++
cur = next
if cur >= n-1 {
return step
}
} else {
return step
}
}
}
return step
}
func max(a, b int) int {
if a > b {
return a
}
return b
}
```
```go
// 贪心版本二
func jump(nums []int) int {
n := len(nums)
if n == 1 {
return 0
}
cur, next := 0, 0
step := 0
for i := 0; i < n-1; i++ {
next = max(nums[i]+i, next)
if i == cur {
cur = next
step++
}
}
return step
}
func max(a, b int) int {
if a > b {
return a
}
return b
}
```
### Javascript
```Javascript
var jump = function(nums) {
let curIndex = 0

View File

@ -139,7 +139,31 @@ func canJUmp(nums []int) bool {
}
```
```go
// 贪心
func canJump(nums []int) bool {
cover := 0
n := len(nums)-1
for i := 0; i <= cover; i++ { // 每次与覆盖值比较
cover = max(i+nums[i], cover) //每走一步都将 cover 更新为最大值
if cover >= n {
return true
}
}
return false
}
func max(a, b int ) int {
if a > b {
return a
}
return b
}
```
### Javascript
```Javascript
var canJump = function(nums) {
if(nums.length === 1) return true

View File

@ -552,6 +552,29 @@ func maxdepth(root *treenode) int {
```
### 559. n叉树的最大深度
```go
func maxDepth(root *Node) int {
if root == nil {
return 0
}
q := list.New()
q.PushBack(root)
depth := 0
for q.Len() > 0 {
n := q.Len()
for i := 0; i < n; i++ {
node := q.Remove(q.Front()).(*Node)
for j := range node.Children {
q.PushBack(node.Children[j])
}
}
depth++
}
return depth
}
```
## javascript

View File

@ -437,6 +437,33 @@ func countNodes(root *TreeNode) int {
}
```
迭代法
```go
func countNodes(root *TreeNode) int {
if root == nil {
return 0
}
q := list.New()
q.PushBack(root)
res := 0
for q.Len() > 0 {
n := q.Len()
for i := 0; i < n; i++ {
node := q.Remove(q.Front()).(*TreeNode)
if node.Left != nil {
q.PushBack(node.Left)
}
if node.Right != nil {
q.PushBack(node.Right)
}
res++
}
}
return res
}
```
## JavaScript: