Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
35 lines (32 loc) · 692 Bytes

File metadata and controls

35 lines (32 loc) · 692 Bytes
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
/**
* 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.
*/
public class JumpGame {
public boolean canJump(int[] A) {
if (A.length <= 1)
return true;
int curMax = 0;
int max = 0;
for (int i = 0; i < A.length - 1; i++) {
if (i > max)
break;
curMax = A[i] + i;
if (curMax > max) {
max = curMax;
}
if (max >= A.length - 1)
return true;
}
return false;
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.