Jump Game
来源:互联网 发布:java gzip 压缩 编辑:程序博客网 时间:2024/05/16 03:39
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
.
bool fun(int a[], int n){int step = a[0];for (int i = 1; i < n; i++){if (step > 0){step--;step = max(step, a[i]);}else{return false;}}return true;}
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
- SDN开发实战(1)-透明HTTP代理[Openflow+floodlight]
- 数独
- Python爬虫实战(一)
- TOMCAT启动闪退
- hash_map,unordered_map的使用
- Jump Game
- javascript原型
- 进度条小程序
- python 中函数format()函数进行字符串格式化
- 第7章 流程控制
- spring boot+前端ajax请求通讯
- 欢迎使用CSDN-markdown编辑器
- iostat和iowait详细解说
- Python使用@staticmethod和@classmethod分别建立方法