## Solution 比 [[LeetCode 0045 - Jump Game II]] 要简单，同样用贪心做就好了。 ## Problem You are given an integer array $\texttt{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. ### Examples #### Example 1 **Input:** $\texttt{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:** $\texttt{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 \leq \texttt{nums.length} \leq 10^4 $ $ 0 \leq \texttt{nums[i]} \leq 10^5 $