leetcode练习 Jump Game
2018-01-10 15:45
337 查看
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.
只需要求出能不能的话,算法就很简单
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.
class Solution { public: bool canJump(vector<int>& nums) { if(nums.size() == 1) return true; int max = 0; for (int i = 0; i < nums.size()-1; i++) { if (max < i + nums[i]) { max = i + nums[i]; } if (max < i+1) return false; if (max >= nums.size()-1) return true; } return false; } };
只需要求出能不能的话,算法就很简单
相关文章推荐
- LeetCode Online Judge 题目C# 练习 - Jump Game
- Leetcode练习 #55 Jump Game
- [leetcode 55] Jump Game
- leetCode练习(85)
- 算法练习(18):Jump Game
- 数据结构与算法[LeetCode]——Jump Game I II
- leetCode---Jump Game
- 34_leetcode_Jump Game
- leetcode(55). Jump Game
- leetCode练习(93)
- Leetcode: Jump Game
- LeetCode Online Judge 题目C# 练习 - Jump Game II
- leetCode练习(95)
- LeetCode Online Judge 题目C# 练习 - Merge k Sorted Lists
- LeetCode: Jump Game
- Leetcode练习<五> 字符串翻转
- LeetCode Online Judge 题目C# 练习 - Set Matrix Zeroes
- LeetCode Online Judge 题目C# 练习 - Substring with Concatenation of All Words
- LeetCode Online Judge 题目C# 练习 - ZigZag Conversion
- LeetCode Online Judge 题目C# 练习 - Balanced Binary Tree