public class Solution {
public int jump(int[] A) {
int count = 0;
int dest = A.length-1;
while (dest!=0) {
for (int i=0; i<A.length; i++) {
if (A[i]+i>=dest) {
dest = i;
count++;
break;
}
}
}
return count;
}
}
没有评论:
发表评论