#116 Jump Game

最新推荐文章于 2019-12-05 16:34:36 发布

易月

最新推荐文章于 2019-12-05 16:34:36 发布

阅读量213

点赞数

分类专栏： lintcode 文章标签： lintcode dynamic programming

本文链接：https://blog.csdn.net/haifischxia/article/details/52313507

版权

lintcode 专栏收录该内容

217 篇文章 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.

Notice

This problem have two method which is Greedy andDynamic Programming.

The time complexity of Greedy method is O(n).

The time complexity of Dynamic Programming method is O(n^2).

We manually set the small data set to allow you pass the test in both ways. This is just to let you learn how to use this problem in dynamic programming ways. If you finish it in dynamic programming ways, you can try greedy method to make it accept again.

Have you met this question in a real interview?

Yes

Example

A = [2,3,1,1,4], return true.

A = [3,2,1,0,4], return false.

题目思路：

这题我还是想用dp来做。假设dp[i]为能不能跳到位置i，那么这取决于那些能够到i的点的dp值是不是true。这样dp方程就出来了。为了通过large test，注意到如果A[0] == 0，答案永远为false （如果A.size() > 1的话），所以遇到这样的情况先return false即可。

Mycode（AC = 31ms）：

class Solution {
public:
    /**
     * @param A: A list of integers
     * @return: The boolean answer
     */
    bool canJump(vector<int> A) {
        // write you code here
        if (A.size() <= 1) return true;
        
        vector<int> dp(A.size() + 1, false);
        dp[0] = true;
        dp[1] = A[0] > 0;
        
        if (A[0] == 0) return false;
        
        for (int i = 1; i <= A.size(); i++) {
            for (int j = i + 1; j <= A[i - 1] + i && j <= A.size(); j++) {
                dp[j] = dp[i];
            }
        }
        
        return dp[A.size()];
    }
};