728x90 Jump Game II1 [LeetCode] 45. Jump Game II You are given a 0-indexed array of integers nums of length n. You are initially positioned at nums[0]. Each element nums[i] represents the maximum length of a forward jump from index i. In other words, if you are at nums[i], you can jump to any nums[i + j] where: 0 2023. 11. 9. 이전 1 다음 728x90
