【C++】【LeetCode】55. Jump Game

zjajgyy

于 2017-07-09 10:27:53 发布

阅读量188

点赞数

分类专栏： LeetCode 文章标签： leetcode

本文链接：https://blog.csdn.net/zjajgyy/article/details/74857560

版权

LeetCode 专栏收录该内容

51 篇文章 0 订阅

订阅专栏

题目

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.

思路

从尾端开始遍历，如果当前数字不能到达下一个位置，则给最低跳跃长度加1，继续遍历下一个数字。这个思路打败了92.23%，笔者非常高兴！

代码

class Solution {
public:
    bool canJump(vector<int>& nums) {
        int numOfJump = 0;

        for (vector<int>::reverse_iterator i = nums.rbegin()+1; i != nums.rend(); i++) {
            if (*i <= numOfJump) {
                numOfJump++;
            } else {
                numOfJump = 0; 
            }
        }
        if (numOfJump == 0) {
            return true;
        } else {
            return false;
        }
    }
};