class Solution {
public:
bool canJump(int A[], int n) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
if(n == 0) return false;
if(n == 1) return true;
int range = A[0];
for(int i = 1; i < n; i++){
if(range >= n-1) return true;
if(i <= range){
range = max(range, A[i] + i);
}
}
return false;
}
};
[leetcode]jump game
最新推荐文章于 2023-02-20 18:28:34 发布