# Jump Game II

`Greedy`, `Breadth-first Search`

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.

Your goal is to reach the last index in the minimum number of jumps.

**Example:**

```
Input:
 [2,3,1,1,4]

Output:
 2

Explanation:
 The minimum number of jumps to reach the last index is 2.
    Jump 1 step from index 0 to 1, then 3 steps to the last index.
```

**Note:**

You can assume that you can always reach the last index.

## Solution & Analysis

### Breadth-first Search

```java
class Solution {
    public int jump(int[] nums) {
        int n = nums.length;

        boolean visited[] = new boolean[n];
        Queue<Integer> q = new LinkedList<>();

        q.offer(0);
        visited[0] = true;
        int jumps = 0;

        while (!q.isEmpty()) {
            int size = q.size();
            while (size-- > 0) {
                int i = q.poll();
                if (i == n - 1) {
                    return jumps;
                }

                for (int j = nums[i]; j >= 0; j--) {
                    int newIdx = j + i;
                    if (newIdx < n && !visited[newIdx]) {
                        visited[newIdx] = true;
                        q.offer(newIdx);
                    }
                }
            }
            jumps++;
        }

        return -1;
    }
}
```

### Greedy

> @Cheng\_Zhang: The main idea is based on **greedy**. Let's say the range of the current jump is \[curBegin, curEnd], curFarthest is the farthest point that all points in \[curBegin, curEnd] can reach. Once the current point reaches curEnd, then trigger another jump, and set the new curEnd with curFarthest, then keep the above steps, as the following:

<https://leetcode.com/problems/jump-game-ii/discuss/18014/Concise-O(n)-one-loop-JAVA-solution-based-on-Greedy>

```java
class Solution {
    public int jump(int[] A) {
        int jumps = 0, curEnd = 0, curFarthest = 0;
        for (int i = 0; i < A.length - 1; i++) {
            curFarthest = Math.max(curFarthest, i + A[i]);
            if (i == curEnd) {
                jumps++;
                curEnd = curFarthest;
            }
        }
        return jumps;
    }
}
```


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://aaronice.gitbook.io/lintcode/graph_search/jump-game-ii.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.