class Solution {
public int chalkReplacer(int[] chalk, int k) {
int len = chalk.length;
long sum = 0;
for(int ch : chalk) sum += ch;
k %= sum;// 多余的部分直接循环去掉
for(int i = 0; i < len; i++){
if(chalk[i] > k) return i;
k -= chalk[i];
}
return -1;
}
}
1894.找到需要补充粉笔的学生编号
最新推荐文章于 2024-10-05 01:22:45 发布