> For the complete documentation index, see [llms.txt](https://anand-aryan.gitbook.io/leetcode/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://anand-aryan.gitbook.io/leetcode/55.-jump-game.md).

# 55. Jump Game

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], return true.

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

## Solution <a href="#solution" id="solution"></a>

```java
public class Solution {
   public boolean canJump(int[] nums) {
        int maxPosition = 0;

        for(int i = 0;;) {
            maxPosition = maxPosition < i + nums[i] ? i + nums[i] : maxPosition;
            if (maxPosition >= nums.length-1) {
                return true;
            }

            if (i < maxPosition) {
                i ++;
            } else {
                return false;
            }

        }
    }
}
```