题目描述:力扣
解题思路:
比较简单,要注意的是当到达数组最后一个时,需回到第一个。
class Solution {
public int[] distributeCandies(int candies, int num_people) {
int[] res = new int[num_people];
int i = 0;
int num = 1;
while(candies > 0){
if(i == num_people){
i = 0;
}
if(candies>=num){
res[i] = res[i]+num;
candies = candies-num;
num++;
}
else{
res[i] = res[i]+candies;
candies = 0;
}
i++;
}
return res;
}
}