Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
33 lines (31 loc) · 788 Bytes

File metadata and controls

33 lines (31 loc) · 788 Bytes
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
package problems;
public class LeetCode45 {
public int jump(int[] nums) {
int length= nums.length;
int end=0,maxPosition=0,step=0;
for(int i=0;i<length-1;i++){
maxPosition=Math.max(maxPosition,i+nums[i]);
if(i==end){
end=maxPosition;
step++;
}
}
return step;
}
}
class LeetCode45_1 {
public int jump(int[] nums) {
int n = nums.length;
int ans = 0, begin = 0, end = 0;
while (end < n - 1) {
int temp = 0;
for (int i = begin; i <= end; i++) {
temp = Math.max(temp, i + nums[i]);
}
begin = end + 1;
end = temp;
ans ++;
}
return ans;
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.