[Medium] Jump Game

问题：
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.

Subscribe to see which companies asked this question
解法：

源码：

class Solution {public:    bool canJump(vector<int>& nums) {        int n = nums.size();        if (!n) return true;        int r = 0;        int i = 0;        while (i <= r && r < n-1) {            r = max(r, nums[i] + i);            r = min(r, n-1);            i++;        }        if (r == n-1) return true;        else return false;    }};