func jump(nums []int) int {
	if len(nums) <= 1 {
		return 0
	}

	visited := make([]int, len(nums)) // 跳到该位置最少需要几步
	for i := 0; i < len(nums)-1; i++ {
		maxStepLen := nums[i]
		for arriveIdx := i; arriveIdx <= i+maxStepLen; arriveIdx++ {
			if arriveIdx >= len(nums) {
				break
			}

			if visited[arriveIdx] == 0 {
				visited[arriveIdx] = visited[i] + 1
			} else {
				visited[arriveIdx] = min(visited[i]+1, visited[arriveIdx])
			}
		}
	}

	return visited[len(nums)-1] - 1
}

func min(a, b int) int {
	if a < b {
		return a
	}
	return b
}