[OJ.leetcode] jump-game
https://oj.leetcode.com/problems/jump-game/ 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. /* A[i]가 0인 elemant가 있을때, 이를 jump할 수 있는지 여부만 없..
더보기