leetcode JAVA Jump Game 难度系数3 3.18
来源:互联网 发布:微商美图软件 编辑:程序博客网 时间:2024/06/03 17:13
Question:
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 class Solution { public boolean canJump(int[] A) {if (A.length <= 1)return true;if (A[0] >= A.length - 1)return true;int maxlen = A[0];if (maxlen == 0)return false;for (int i = 1; i < A.length - 1; i++) {if (maxlen >= i && (i + A[i]) >= A.length - 1)return true;if (maxlen <= i && A[i] == 0)return false;if ((i + A[i]) > maxlen)maxlen = i + A[i];}return false;}}
0 0
- leetcode JAVA Jump Game 难度系数3 3.18
- leetcode JAVA Permutations 难度系数3 3.14
- leetcode JAVA Anagrams 难度系数3 3.15
- leetcode JAVA Combinations 难度系数3 3.26
- leetcode JAVA Subsets 难度系数3 3.27
- leetcode JAVA Triangle 难度系数3 3.42
- [Leetcode] Jump Game (Java)
- [LeetCode][Java] Jump Game
- leetcode:Jump Game 【Java】
- Jump Game leetcode java
- leetcode JAVA Combination Sum 难度系数3 3.13
- leetcode JAVA Pow(x, n) 难度系数3 3.16
- leetcode JAVA Maximum Subarray 难度系数3 3.17
- leetcode JAVA Spiral Matrix II 难度系数3 3.19
- leetcode JAVA Rotate List 难度系数3 3.20
- leetcode JAVA Unique Paths II 难度系数3 3.21
- leetcode JAVA Minimum Path Sum 难度系数3 3.22
- leetcode JAVA Simplify Path 难度系数3 3.23
- Qt模块化笔记之Qt Widgets——子区域和子窗口
- 最小费用最大流uva10806+spfa
- leetcode JAVA Pow(x, n) 难度系数3 3.16
- leetcode JAVA Maximum Subarray 难度系数3 3.17
- CodeForces 387E George and Cards
- leetcode JAVA Jump Game 难度系数3 3.18
- 数据库之《会员管理系统》
- Oracle学习笔记(1)—— Sqlplus介绍
- leetcode JAVA Spiral Matrix II 难度系数3 3.19
- leetcode JAVA Rotate List 难度系数3 3.20
- leetcode JAVA Unique Paths II 难度系数3 3.21
- leetcode JAVA Minimum Path Sum 难度系数3 3.22
- Sublime Text 2 设置文件详解
- leetcode JAVA Simplify Path 难度系数3 3.23