Jump Game
来源:互联网 发布:淘宝卖家设置花呗支付 编辑:程序博客网 时间:2024/06/03 21:19
Jump Game
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
.
用一个状态cur表示现在能跳的最远的位置
代码:
class Solution {public: bool canJump(vector<int>& nums) { int len=nums.size(); int cur=0; for (int i=0; i<len; i++) { if (cur>=i) { if ((i+nums[i])<=cur) continue; cur=i+nums[i]; } else { return false; } } if (cur>=(len-1)) return true; 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
- HTTP请求报文和HTTP响应报文
- 编辑器中显示font property font-family has not generic default
- 第七届蓝桥杯决赛JavaB组第三题_打靶
- HTML关键字<2>
- bootstrap巨幕
- Jump Game
- Good Luck in CET-4 Everybody! (巴什博弈 bash game)
- [Maven] resource配制include与exclude的关系
- 自定义ViewPager
- 《Data Mining》学习——FP-growth算法
- Java并发编程(六)——Executors
- SAP HANA SQL IFNULL和NULLIF用法与区别
- Java 网络编程
- Python从Excel中读取日期一列