-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathJumpGame.cpp
42 lines (36 loc) · 828 Bytes
/
JumpGame.cpp
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
36
37
38
39
40
41
42
//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.
#include<vector>
#include<algorithm>
using namespace std;
class JumpGame {
public:
bool canJump(vector<int>& nums) {
int n = nums.size();
vector<bool> can(n, false);
can[0] = true;
int end = 0;
for (int i = 0; i<n - 1; ++i){
if (can[i]){
if (i + nums[i] >= n){
return true;
}
else{
if (i + nums[i]>end){
for (int j = end + 1; j <= i + nums[i]; ++j) can[j] = true;
end = i + nums[i];
}
}
}
}
return can[n - 1];
}
};