55. Jump Game

标签：log   节点   determine   cto   bsp   jump game   tor   initial   size   

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) {
        for(int i=0,farthest=0;i<nums.size()&&i<=farthest;i++){
            farthest=max(farthest,i+nums[i]);
            if(farthest>=nums.size()-1)return true;
        }
        return false;
    }
};

55. Jump Game

标签：log   节点   determine   cto   bsp   jump game   tor   initial   size   

原文地址：http://www.cnblogs.com/tsunami-lj/p/6568906.html