Leetcode: Jump Game
LeetCode Game Jump
2023-09-11 14:14:08 时间
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.
Greedy Solution
1 public boolean canJump(int[] nums) { 2 int reachable = 0; 3 for (int i=0; i<nums.length; ++i) { 4 if (i > reachable) return false; 5 reachable = Math.max(reachable, i + nums[i]); 6 } 7 return true; 8 }
相关文章
- LeetCode 第 196 场周赛 (题目:5452-5455,这是参加过最坑的周赛,暴力n^2居然可以过)
- Java实现 LeetCode 630 课程表 III(大小堆)
- Java实现 LeetCode 299 猜数字游戏
- Java实现 LeetCode 116 填充每个节点的下一个右侧节点指针
- Java实现 LeetCode 10 正则表达式匹配
- Java实现LeetCode_0001_Two Sum
- Java实现 LeetCode_0048_RotateImage
- LeetCode:110_Balanced Binary Tree | 平衡二叉树 | Easy
- [LeetCode] Best Time to Buy and Sell Stock
- Python 刷Leetcode题库,顺带学英语单词(14)
- Leetcode 217 Contains Duplicate
- Median of Two Sorted Arrays--LeetCode
- leetcode第一刷_Jump Game
- LeetCode 432. 全 O(1) 的数据结构
- 【LeetCode】105. 从前序与中序遍历序列构造二叉树
- 【LeetCode】78. 子集