leetcodeOJ 55. Jump Game
来源:互联网 发布:表演系 知乎 编辑:程序博客网 时间:2024/06/09 14:54
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
.
class Solution {public: bool canJump(vector<int>& nums) { int n = nums.size(); int reach = n-1; for(int i = n-2; i >= 0; i--){ if(nums[i] + i >= reach) reach = i; } return reach <= 0; }};
0 0
- leetcodeOJ 55. Jump Game
- LeetCodeOJ.Jump Game II
- 55. Jump Game && 45. Jump Game II
- 55. Jump Game. 45. Jump Game II
- [LeetCode]55.Jump Game
- LeetCode 55.Jump Game
- LeetCode --- 55. Jump Game
- [Leetcode] 55. Jump Game
- [leetcode] 55.Jump Game
- 55. Jump Game
- 55. Jump Game
- [leetcode] 55.Jump Game
- *LeetCode 55. Jump Game
- LeetCode 55. Jump Game
- [leetcode] 55. Jump Game
- 55. Jump Game
- leetcode 55. Jump Game
- 55. Jump Game LeetCode
- va_start和va_end使用详解
- 把数组排成最小的数
- C# Json 序列化与反序列化的简单演示
- android listview的一些设置
- ODS设计思路-ODS到DW同步
- leetcodeOJ 55. Jump Game
- Lombok 安装使用
- data url简介及data url的利弊
- 深入理解C++虚函数底层机制和RTTI运行时类型识别
- 最新 macOS Sierra 10.12.3 安装CocoaPods及使用详解
- 山东省第七届ACM大学生程序设计竞赛
- 冒泡排序
- ExtJS 介绍
- 正则表达式