leetcode-Jump Game II (2014.3.3)
2014-04-15 20:03
288 查看
参考的网上的答案,似乎和jump game有很大的不同。还没有弄明白,mark。
class Solution {
public:
int jump(int A[], int n) {
int lastJump=0;
int maxJump=0;
int num=0;
int i=0;
for(int i=0;i<n;i++){
if(i>lastJump){
if(maxJump<=lastJump) return 0;
lastJump=maxJump;
++num;
}
if(maxJump<A[i]+i) maxJump=A[i]+i;
}
return num;
}
};
class Solution {
public:
int jump(int A[], int n) {
int lastJump=0;
int maxJump=0;
int num=0;
int i=0;
for(int i=0;i<n;i++){
if(i>lastJump){
if(maxJump<=lastJump) return 0;
lastJump=maxJump;
++num;
}
if(maxJump<A[i]+i) maxJump=A[i]+i;
}
return num;
}
};