LeetCode 55. Jump Game
来源:互联网 发布:洪厚甜网络书法 编辑:程序博客网 时间:2024/06/16 10:36
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
.
设立flag为当处在i下标的时候,前面所能够达到的所有长度的最大值(因为是最大值,所以0~最大值的所有下标都可以遍历到)。因此,判断最后能够到达的距离是否大于nums.size()-1。
class Solution {public: bool canJump(vector<int>& nums) { int flag=0; for(int i=0;i<nums.size()&&i<=flag;i++){ flag=max(flag,i+nums[i]); } return flag>=nums.size()-1; }};
阅读全文
0 0
- [LeetCode]55.Jump Game
- LeetCode 55.Jump Game
- LeetCode --- 55. Jump Game
- [Leetcode] 55. Jump Game
- [leetcode] 55.Jump Game
- [leetcode] 55.Jump Game
- *LeetCode 55. Jump Game
- LeetCode 55. Jump Game
- [leetcode] 55. Jump Game
- leetcode 55. Jump Game
- 55. Jump Game LeetCode
- 【LeetCode】55. Jump Game
- leetcode 55. Jump Game
- [LeetCode] 55. Jump Game
- LeetCode 55. Jump Game
- LeetCode *** 55. Jump Game
- Leetcode 55. Jump Game
- LeetCode-55.Jump Game
- C#中控件Control的Paint事件和OnPaint虚函数的区别
- springMVC中简单的web.xml配置信息
- 1134. Vertex Cover (25)
- Web框架面试题
- 实验一报告
- LeetCode 55. Jump Game
- 排序算法
- dataTable的几种数据展现格式
- 计算机硬件五大单元
- 9-16 DAIRY
- Redis学习-List
- Eshop(1)
- spring整合redis,一种持久key-value的数据库
- 剑指Offer--11.二进制中1的个数