CODE 78: Jump Game
来源:互联网 发布:阿里云code 私有 编辑:程序博客网 时间:2024/05/15 07:51
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
.
public boolean canJump(int[] A) {// Note: The Solution object is instantiated only once and is reused by// each test case.if (A.length == 1) {return A[0] >= 0;}for (int i = 1; i < A.length; i++) {if (A[i - 1] - 1 < 0) {return false;} else {A[i] = Math.max(A[i - 1] - 1, A[i]);}}return true;}
- CODE 78: Jump Game
- [leet code] Jump Game
- CODE 88: Jump Game II
- Leet code —Jump Game
- Leet Code—Jump Game II
- 【Leet Code】55. Jump Game---Medium
- Jump Game
- Jump Game
- Jump Game
- Jump Game
- Jump Game
- Jump Game
- Jump Game
- Jump Game
- Jump Game
- Jump Game
- Jump Game
- Jump Game
- linuxC编程之文件操作与进程初步
- 2013百度校招笔试题
- Eclipse常见乱码问题的解决方案汇总
- android应用开发之配置渐变色
- Jquery
- CODE 78: Jump Game
- nbut_1010 魔法少女 dp
- java为什么计算时间从1970年1月1日开始
- CString/string 区别及其转化
- 学习笔记:Android系统架构
- Cpp_Primer_CH3
- javax.swing.JFrame中使用jpanel来布局
- 2013/10/11 IGT笔试
- PHP中this,self,parent的区别