package LeetCode.OneThousandMore;
public class OneThousandOneHundredAndThree {
public int[] distributeCandies(int candies, int num_people) {
int sum [] = new int[num_people];
int n = 1, i = 0;//n为发的糖果数量,i为数组下标
while (candies != 0) {
sum[i % num_people] += Math.min(candies, i + 1);
candies -= Math.min(candies, i + 1);
i += 1;
}
return sum;
}
}
LeetCode——1103.分糖果Ⅱ(java)
最新推荐文章于 2024-10-17 10:27:13 发布