【LeetCode】55. Jump Game
来源:互联网 发布:怎么举报网络诈骗 编辑:程序博客网 时间:2024/06/01 19:32
问题描述
https://leetcode.com/problems/jump-game/#/description
Given an array of non-negative integers, you are initially positioned at the first index of the array.
Each element in the array represents your maximum jump length at that position.
Determine if you are able to reach the last index.
For example: A = [2,3,1,1,4]
, return true
.
A = [3,2,1,0,4]
, return false
.
算法分析
动态规划
设f(i)
为在i
位置能到达的最大位置:
f(0) = nums[0]f(i) = max(f(i-1), i+nums[i]), f(i-1)>=i = 0, f(i-1)<i ,此时可直接return false
最后若f(nums.length-2)>nums.length-1
,则返回true
;否则,返回false
。
代码
public boolean canJump(int[] nums) { if(nums.length==0) return false; if(nums.length==1) return true; int[] f = new int[nums.length]; f[0] = nums[0]; for(int i=1;i<nums.length;i++) { if(i<=f[i-1]) { f[i] = Math.max(f[i-1], i+nums[i]); } else { return false; } } return f[nums.length-2]>=nums.length-1; }
LeetCode解题代码仓库:https://github.com/zgljl2012/leetcode-java
阅读全文
0 0
- [LeetCode]55.Jump Game
- LeetCode 55.Jump Game
- LeetCode --- 55. Jump Game
- [Leetcode] 55. Jump Game
- [leetcode] 55.Jump Game
- [leetcode] 55.Jump Game
- *LeetCode 55. Jump Game
- LeetCode 55. Jump Game
- [leetcode] 55. Jump Game
- leetcode 55. Jump Game
- 55. Jump Game LeetCode
- 【LeetCode】55. Jump Game
- leetcode 55. Jump Game
- [LeetCode] 55. Jump Game
- LeetCode 55. Jump Game
- LeetCode *** 55. Jump Game
- Leetcode 55. Jump Game
- LeetCode-55.Jump Game
- WannaCry 2.0 已能通过 Wine 感染 Linux 系统
- jdbc简介与使用md
- 分销系统_三级分销_掌上商城推广新渠道-泉州市丰泽区尚创网络科技有限公司
- 初识Edward——一个简单的变分Bayesian网络
- caffe绘制训练过程的loss和accuracy曲线
- 【LeetCode】55. Jump Game
- Sqlserver取整
- FLIP 动画实现多维网格的过渡
- 核桃的数目
- java基础技术知识点总结——容器、迭代器
- 使用Jquery+EasyUI 进行框架项目开发案例讲解之一 员工管理源码分享
- thinkphp 出现Class 'PDO' not found 错误
- 巨人网络面试
- KEIL的安装与使用