class Solution {
public int chalkReplacer(int[] chalk, int k) {
int i = 0;
while(true){
k -= chalk[i];
if(k < 0){
return i;
}
if(i == chalk.length - 1){
i = 0;
}else{
i++;
}
}
}
}
力扣学生补充粉笔
最新推荐文章于 2024-09-28 10:34:40 发布