leetcode/JumpGame.java at master · mengli/leetcode · GitHub

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
/**
 * Given an array of non-negative integers, you are initially positioned at the first index of the
 * array.
 *
 * <p>Each element in the array represents your maximum jump length at that position.
 *
 * <p>Determine if you are able to reach the last index.
 *
 * <p>For example: A = [2,3,1,1,4], return true.
 *
 * <p>A = [3,2,1,0,4], return false.
 */
publicclassJumpGame {
publicbooleancanJump(int[] A) {
if (A.length <= 1) returntrue;
intcurMax = 0;
intmax = 0;
for (inti = 0; i < A.length - 1; i++) {
if (i > max) break;
curMax = A[i] + i;
if (curMax > max) {
max = curMax;
 }
if (max >= A.length - 1) returntrue;
 }
returnfalse;
 }
}
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
/**
 * Given an array of non-negative integers, you are initially positioned at the first index of the
 * array.
 *
 * <p>Each element in the array represents your maximum jump length at that position.
 *
 * <p>Determine if you are able to reach the last index.
 *
 * <p>For example: A = [2,3,1,1,4], return true.
 *
 * <p>A = [3,2,1,0,4], return false.
 */
publicclassJumpGame {
publicbooleancanJump(int[] A) {
if (A.length <= 1) returntrue;
intcurMax = 0;
intmax = 0;
for (inti = 0; i < A.length - 1; i++) {
if (i > max) break;
curMax = A[i] + i;
if (curMax > max) {
max = curMax;
 }
if (max >= A.length - 1) returntrue;
 }
returnfalse;
 }
}
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
/**
 * Given an array of non-negative integers, you are initially positioned at the first index of the
 * array.
 *
 * <p>Each element in the array represents your maximum jump length at that position.
 *
 * <p>Determine if you are able to reach the last index.
 *
 * <p>For example: A = [2,3,1,1,4], return true.
 *
 * <p>A = [3,2,1,0,4], return false.
 */
publicclassJumpGame {
publicbooleancanJump(int[] A) {
if (A.length <= 1) returntrue;
intcurMax = 0;
intmax = 0;
for (inti = 0; i < A.length - 1; i++) {
if (i > max) break;
curMax = A[i] + i;
if (curMax > max) {
max = curMax;
 }
if (max >= A.length - 1) returntrue;
 }
returnfalse;
 }
}
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
/**
 * Given an array of non-negative integers, you are initially positioned at the first index of the
 * array.
 *
 * <p>Each element in the array represents your maximum jump length at that position.
 *
 * <p>Determine if you are able to reach the last index.
 *
 * <p>For example: A = [2,3,1,1,4], return true.
 *
 * <p>A = [3,2,1,0,4], return false.
 */
publicclassJumpGame {
publicbooleancanJump(int[] A) {
if (A.length <= 1) returntrue;
intcurMax = 0;
intmax = 0;
for (inti = 0; i < A.length - 1; i++) {
if (i > max) break;
curMax = A[i] + i;
if (curMax > max) {
max = curMax;
 }
if (max >= A.length - 1) returntrue;
 }
returnfalse;
 }
}
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
/**
 * Given an array of non-negative integers, you are initially positioned at the first index of the
 * array.
 *
 * <p>Each element in the array represents your maximum jump length at that position.
 *
 * <p>Determine if you are able to reach the last index.
 *
 * <p>For example: A = [2,3,1,1,4], return true.
 *
 * <p>A = [3,2,1,0,4], return false.
 */
publicclassJumpGame {
publicbooleancanJump(int[] A) {
if (A.length <= 1) returntrue;
intcurMax = 0;
intmax = 0;
for (inti = 0; i < A.length - 1; i++) {
if (i > max) break;
curMax = A[i] + i;
if (curMax > max) {
max = curMax;
 }
if (max >= A.length - 1) returntrue;
 }
returnfalse;
 }
}
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
/**
 * Given an array of non-negative integers, you are initially positioned at the first index of the
 * array.
 *
 * <p>Each element in the array represents your maximum jump length at that position.
 *
 * <p>Determine if you are able to reach the last index.
 *
 * <p>For example: A = [2,3,1,1,4], return true.
 *
 * <p>A = [3,2,1,0,4], return false.
 */
publicclassJumpGame {
publicbooleancanJump(int[] A) {
if (A.length <= 1) returntrue;
intcurMax = 0;
intmax = 0;
for (inti = 0; i < A.length - 1; i++) {
if (i > max) break;
curMax = A[i] + i;
if (curMax > max) {
max = curMax;
 }
if (max >= A.length - 1) returntrue;
 }
returnfalse;
 }
}
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
/**
 * Given an array of non-negative integers, you are initially positioned at the first index of the
 * array.
 *
 * <p>Each element in the array represents your maximum jump length at that position.
 *
 * <p>Determine if you are able to reach the last index.
 *
 * <p>For example: A = [2,3,1,1,4], return true.
 *
 * <p>A = [3,2,1,0,4], return false.
 */
publicclassJumpGame {
publicbooleancanJump(int[] A) {
if (A.length <= 1) returntrue;
intcurMax = 0;
intmax = 0;
for (inti = 0; i < A.length - 1; i++) {
if (i > max) break;
curMax = A[i] + i;
if (curMax > max) {
max = curMax;
 }
if (max >= A.length - 1) returntrue;
 }
returnfalse;
 }
}
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
/**
 * Given an array of non-negative integers, you are initially positioned at the first index of the
 * array.
 *
 * <p>Each element in the array represents your maximum jump length at that position.
 *
 * <p>Determine if you are able to reach the last index.
 *
 * <p>For example: A = [2,3,1,1,4], return true.
 *
 * <p>A = [3,2,1,0,4], return false.
 */
publicclassJumpGame {
publicbooleancanJump(int[] A) {
if (A.length <= 1) returntrue;
intcurMax = 0;
intmax = 0;
for (inti = 0; i < A.length - 1; i++) {
if (i > max) break;
curMax = A[i] + i;
if (curMax > max) {
max = curMax;
 }
if (max >= A.length - 1) returntrue;
 }
returnfalse;
 }
}