Problem
You are given an integer array nums. You are initially positioned at the array's first index, and each element in the array represents your maximum jump length at that position.
Return true if you can reach the last index, or false otherwise.
Example 1:
Input: nums = [2,3,1,1,4] Output: true Explanation: Jump 1 step from index 0 to 1, then 3 steps to the last index.
Example 2:
Input: nums = [3,2,1,0,4] Output: false Explanation: You will always arrive at index 3 no matter what. Its maximum jump length is 0, which makes it impossible to reach the last index.
Constraints:
1 <= nums.length <= 1040 <= nums[i] <= 105
Approach
EN
KR
점프해서 도착한 곳이 0이면 리턴 false
jump 변수를 선언하고 nums[0]의 값을 저장한다.
nums[jump]를 또 jump에 더해준다.
만약 jump가 배열의 길이보다 크면 true, 작으면 false
이렇게 까지 생각했는데 코드 구현에 실패해서 계속 도전하고 있다.
code
Look at art, make art, show art and be art. So does as code.