int chalkReplacer(int* chalk, int chalkSize, int k){
long all = 0,i;
for(i=0;i<chalkSize;i++){
all = all + chalk[i];
}
if(all==0||k==0)
return 0;
k = k%all;
for(i=0;i<chalkSize;i++){
if(k>=0){
k = k-chalk[i];
}
if(k<0)
break;
}
return i;
}
09-10
164
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
06-13
250
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
09-10
162
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
10-16
331
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
09-10
118
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
07-01
94
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
09-06
“相关推荐”对你有帮助么?
-
非常没帮助
-
没帮助
-
一般
-
有帮助
-
非常有帮助
提交