class Solution {
    public int jump(int[] nums) {
        int[] dp = new int[nums.length];
        int p = 1;
        for (int i = 0; i < nums.length; ++i) {
            while (p <= nums[i] + i && p < nums.length) {
                dp[p] = dp[i] + 1;
                ++p;
            }
        }
        return dp[nums.length - 1];
    }
}