FilesExpand file tree

 master

/

jumpGame.cpp

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

41 lines (36 loc) · 1.15 KB

 master

/

jumpGame.cpp

Copy path

Top

File metadata and controls

• Code
• Blame

41 lines (36 loc) · 1.15 KB

Raw

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

36

37

38

39

40

41

// Source : https://oj.leetcode.com/problems/jump-game/

// Author : Hao Chen

// Date : 2014-06-27

/**********************************************************************************

*

* 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.

*

*

**********************************************************************************/

class Solution {

public:

bool canJump(int A[], int n) {

if (n<=0) return false;

// the basic idea is traverse array, maintain the most far can go

int coverPos=0;

// the condition i<=coverPos means traverse all of covered position

for(int i=0; i<=coverPos && i<n; i++){

if (coverPos < A[i] + i){

coverPos = A[i] + i;

}

if (coverPos>=n-1){

return true;

}

}

return false;

}

};