116. Jump Game

116. 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.

Example

Example 1

Input : [2,3,1,1,4]
Output : true

Example 2

Input : [3,2,1,0,4]
Output : false

Notice

This problem have two method which is Greedy and Dynamic 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.

 

DP:

public class Solution {
    /**
     * @param A: A list of integers
     * @return: A boolean
     */
    public boolean canJump(int[] A) {
        // write your code here
        int m = A.length;
        boolean []f = new boolean[m];
        f[0] = true;
        for(int i=1; i<m; i++)
        {
            f[i] = false;
            for(int j=0; j<i; j++)
            {
                if(f[j] && A[j]>=i-j)
                {
                    f[i] = true;
                    break;
                }
            }
        }
        return f[m-1];
    }
}

 

贪心:

public class Solution {
    /**
     * @param A: A list of integers
     * @return: A boolean
     */
    public boolean canJump(int[] A) {
        // write your code here
        int m = A.length;
        int left = m-1,  valid = m-1;
        for(left=m-1; left>=0; left--)
        {
            if((valid-left) <=A[left])
            {
                valid = left;
                
            }
            
        }
        return valid == 0;
    }
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值