55-Jump Game
来源:互联网 发布:李乐的霍去病 知乎 编辑:程序博客网 时间:2024/06/03 14:52
题目
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 len = nums.size(); if (len == 0) return false; int nextPos = len-1; for (int i = len - 1; i >= 0; i--) { if (i + nums[i] >= nextPos) { nextPos = i; } } return nextPos == 0; }};
阅读全文
0 0
- LeetCode 55: Jump Game
- [leetcode 55] Jump Game
- LeetCode(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
- Jump Game - LeetCode 55
- 【Leetcode】Jump Game #55
- Leetcode #55 Jump Game
- 【LeetCode】55:Jump Game
- LeetCode(55) Jump Game
- Leetcode#55||Jump Game
- 55Jump Game
- (leetcode #55)Jump Game
- Leetcode 55 - Jump Game
- 判断值为空
- 54-Spiral Matrix
- 修改oracle 10g的字符集
- PhoneGap || Cordova 安装以及导入AndroidStudio 遇到的问题
- Filter和Servlet的区别
- 55-Jump Game
- Java之FileChannel类的理解和使用
- MyBatis常用对象SqlSessionFactory和SqlSession介绍和运用
- mysql数据库优化--(3)设计 范式 Normal Format, 规范的格式
- 56-Merge Intervals && 57-Insert Interval
- 写给非专业人士看的 Shadowsocks 简介
- PAT练习-程序运行时间
- 61-Rotate List
- 20170623