Leetcode 55. Jump Game (Medium) (cpp)
2016-07-29 21:05
513 查看
Leetcode 55. Jump Game (Medium) (cpp)
Tag: Array, Greedy
Difficulty: Medium
Tag: Array, Greedy
Difficulty: Medium
/* 55. Jump Game (Medium) 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. */ class Solution { public: bool canJump(vector<int>& nums) { int steps = 0, _size = nums.size(); for (int i = 0; i < _size; i++) { if (steps <= nums[i]) steps = nums[i]; if (steps >= _size - 1 - i) return true; if (--steps < 0) return false; } return false; } };
相关文章推荐