[leetcode 55. Jump Game]week 7
来源:互联网 发布:黄金利多利空数据软件 编辑:程序博客网 时间:2024/06/04 18:36
一、题目
Given anarray of non-negative integers, you are initially positioned at the first indexof the array.
Each element in the array represents your maximum jumplength 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.
二、代码
class Solution {
public:
bool canJump(vector<int>& nums) {
int maxjump=1;
for (int i=0;i<maxjump;i++)
{
if (maxjump>nums.size())
break;
if (i+nums[i]+1 > maxjump)
maxjump=i+nums[i]+1;
}
if (maxjump>=nums.size())
return true;
else
return false;
}
};
三、思路
要到达最后一步则判断每一步后更新的可到达最大步数即可,所以用贪婪算法从第一步起每走一步比较原最大值与i+A[i]+1并更新,到最后若最大值大于容器大小(即最后一步)即可。此种解题方法时间复杂度为O(n)
- [leetcode 55. Jump Game]week 7
- LeetCode week 7 : Jump Game II
- [week 19][Leetcode]Jump Game
- LeetCode week 6 : 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
- leetcode 55. Jump Game
- 55. Jump Game LeetCode
- 【LeetCode】55. Jump Game
- leetcode 55. Jump Game
- [LeetCode] 55. Jump Game
- 量化初学者的随想1
- Tomcat 学习 应用
- [leetcode 204. Count Primes]week 3
- [leetcode 104. Maximum Depth of Binary Tree]week 5
- 80端口被占用 PID 4
- [leetcode 55. Jump Game]week 7
- [leetcode 50. Pow(x, n)]week 11
- [leetcode 19 Remove Nth Node From End of List]week 13
- 两类strling数
- [leetcode Merge Two Sorted Lists]week 15
- [leetcode Search Insert Position]week 17
- Linux(redhat6.5)下 安装mysql5.7.18——yum方式
- [leetcode Best Time to Buy and Sell Stock]week 18
- [leetcode Maximum Subarray]week 19