LeetCode 55. Jump Game [python3/C++]

转载请注明出处：https://blog.csdn.net/yyying2016/article/details/80170344

一 题目

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.

Example 1:

Input: [2,3,1,1,4]
Output: true
Explanation: Jump 1 step from index 0 to 1, then 3 steps to the last index.

Example 2:

Input: [3,2,1,0,4]
Output: false
Explanation: You will always arrive at index 3 no matter what. Its maximum
             jump length is 0, which makes it impossible to reach the last index.

二 分析

    这道题的大意是从下标index=0开始，你每次可以向前跳k格，并且k满足k < m，m为该格的数字。

    很明显可以用贪心算法来解决这道题。每次都标记自己能走到的最远的位置，如果还没到达终点，则对未走过的格子向前遍历；如果已经没有未走过的格子，且没到达终点，则输出false；到达终点则输出true。

三 代码

python3：

class Solution:
    def canJump(self, nums):
        """
        :type nums: List[int]
        :rtype: bool
        """
        far = nums[0]
        n = len(nums)
        flag = False
        for i in range(n):
            if i > far:
                return False
            elif i + nums[i] > far:
                far = i + nums[i]
        return True

C++：

class Solution {
public:
    bool canJump(vector<int>& nums) {
        int n = nums.size();
        int flag[n+2];
        bool ans = true;
        for(int i = 0; i < n; i++) {
            flag[i] = 0;
        }
        flag[0] = 1;
        for(int i = 0; i < n; i++) {
            if(flag[i] == 0){
                ans = false;
                break;
            }
            if(i + nums[i] >= n)
                break;
            for(int j = 1; j <= nums[i]; j++)
                flag[i+j] = 1;
        }
        return ans;
    }
};