贪心法、动态规划——jump-game,jump-gameII

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], returntrue.

A =[3,2,1,0,4], returnfalse.

记录并更新maxindex为所能跳到的最远距离，若maxindex大于等于最后位置的指数nums.length-1则返回true.

public class Solution {
    public boolean canJump(int[] nums) {
        if(nums == null||nums.length == 0)
            return false;
        //初始化的maxindex值为nums[0];
        int maxindex=nums[0];
        for(int i=0;i<=maxindex;i++)
            {
            if(maxindex>=nums.length-1)
                return true;
            if(i+nums[i]>maxindex)
                maxindex=i+nums[i];
        }
        return false;
    }
}

jump-game-ii

第二道题是在第一题的追问,求出最小跳数.

求最优解考虑动态规划：

import java.util.*;
public class Solution {
    public int jump(int[] nums) {
        //dp dp[i]表示达到下标为i的所需的最小步数
        if(nums == null||nums.length == 0)
            return -1;
        int[] dp=new int[nums.length];
        Arrays.fill(dp,Integer.MAX_VALUE);
        dp[0]=0;
        for(int i=1;i<nums.length;i++)
            {
            for(int j=0;j<i;j++)
                {
                if(j+nums[j]>=i)
                    {
                    if(dp[i]>dp[j]+1)
                        {
                        dp[i]=dp[j]+1;
                    }
                }
            }
        }
        return dp[dp.length-1];
    }
}