Jump Game

标签：style   blog   http   io   ar   color   os   sp   for   

 参考：http://fisherlei.blogspot.com/2012/12/leetcode-jump-game.html

http://blog.csdn.net/linhuanmars/article/details/21354751

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.

C++实现代码：

#include<iostream>
using namespace std;

class Solution
{
public:
    bool canJump(int A[],int n)
    {
        int maxSum=0;
        int sum=0;
        int i;
        for(i=0;i<=maxSum&&i<n;i++)
        {
            sum=i+A[i];
            if(sum>maxSum)
                maxSum=sum;
            if(maxSum>=n-1)
                return true;
        }
        return false;
    }
};

int main()
{
    Solution s;
    int A[5]={3,2,1,0,4};
    cout<<s.canJump(A,5)<<endl;
}

Jump Game

标签：style   blog   http   io   ar   color   os   sp   for   

原文地址：http://www.cnblogs.com/wuchanming/p/4116760.html