LeetCode Jump Game
来源:互联网 发布:电视人工智能什么意思 编辑:程序博客网 时间:2024/05/21 10:39
题目
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
.
和之前的Jump Game II相似,只是这次是判断是否可以到达;
采用相同的思路,具体见Jump Game II,
当两步之间可以到达的最远距离不变时(且没有超过终点),说明终点无法到达。
代码:
class Solution {public: bool canJump(int A[], int n) {int last_end=-1,end=0;//上一步结束时可到达的最远位置,当前步可到达的最远位置int i,temp;while(end<n-1){temp=end;for(i=last_end+1;i<=end;i++)if(i+A[i]>temp)temp=i+A[i];last_end=end;end=temp;if(end==last_end)break;}if(end>=n-1)return true;elsereturn false; }};
0 0
- LeetCode Jump Game && Jump GameII
- [LeetCode]Jump Game II、Jump Game
- 【LeetCode】Jump Game & Jump Game II
- leetcode Jump Game & Jump Game II
- leetcode之Jump Game && Jump Game II
- [leetcode]Jump Game &&Jump Game II
- 【LeetCode】Jump Game && Jump Game II
- [Leetcode]Jump Game && Jump Game II
- Leetcode之Jump Game & Jump Game II
- Jump Game 和Jump Game II---LeetCode
- LeetCode-Jump Game & Jump Game II
- 【Leetcode】【python】Jump Game/Jump Game II
- LeetCode: Jump Game
- LeetCode: Jump Game II
- LeetCode Jump Game
- LeetCode Jump Game II
- LeetCode : Jump Game
- LeetCode: Jump Game II
- 黑马程序员——C语言之循环结构
- 母牛的故事
- 2014年7月谷歌可用IP
- 常用排序算法之冒泡排序c及lua实现
- hdu 1425 sort
- LeetCode Jump Game
- CMap与hash_map效率对比
- 注解开发
- Android 密码MD5加密
- UICollectionView添加Footer
- Junit 4 Tutorials(Junit 4 教程)
- Android读取资源文件
- Android学习——利用反射调用@Hide隐藏函数
- sql server 2008如何导入mdf,ldf文件