Open youngyangyang04 opened 3 months ago
https://www.programmercarl.com/0055.%E8%B7%B3%E8%B7%83%E6%B8%B8%E6%88%8F.html
int cover = 0; for (int i = 0; i <= cover; i++) { cover = Math.max(i + nums[i], cover); if (cover >= nums.length - 1){ return true; } } return false;
https://www.programmercarl.com/0055.%E8%B7%B3%E8%B7%83%E6%B8%B8%E6%88%8F.html