Jump Game
来源:互联网 发布:java视频教程哪个最好 编辑:程序博客网 时间:2024/06/16 17:44
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 size = nums.size(); if (size < 2) { return true; } int left = 1; int right = nums[0]; while (left <= right) { if (right >= size-1) { return true; } int maxRight = 0;//贪心算法 for (int i = left; i <= right; i++) { if (nums[i] + i > maxRight) { maxRight = nums[i] + i; } } left = right+1; right = maxRight; } return false; }};
0 0
- Jump Game
- Jump Game
- Jump Game
- Jump Game
- Jump Game
- Jump Game
- Jump Game
- Jump Game
- Jump Game
- Jump Game
- Jump Game
- Jump Game
- Jump Game
- Jump Game
- Jump Game
- Jump Game
- Jump Game
- Jump Game
- Hbase配置项简介
- ruby on rails 数据库搜索中in的用法
- poj1753 Flip Game
- 第五篇 第一周----周末总结
- Spring MVC 中的 forward 和 redirect
- Jump Game
- Spring事务传播性与隔离级别
- spring3学习笔记之(spring core 之DI 更多知识点(依赖检查和方法注入))
- 使用MinGW 与 MSYS 编译 ffmpeg 的问题说明
- SpringMVC的forward和redirect
- 下拉刷新组件和切换组件结合使用
- ubuntu下qt调试no such value!
- Tesseract 的OSGI环境下面一直报”java.lang.RuntimeException: Need to install JAI Image I/O package.“的解决办法
- hbase 租约超时及rpc超时出现的问题