Distribute Candies to People (E)
題目
We distribute some number of candies, to a row of n = num_people people in the following way:
We then give 1 candy to the first person, 2 candies to the second person, and so on until we give n candies to the last person.
Then, we go back to the start of the row, giving n + 1 candies to the first person, n + 2 candies to the second person, and so on until we give 2 * n candies to the last person.
This process repeats (with us giving one more candy each time, and moving to the start of the row after we reach the end) until we run out of candies. The last person will receive all of our remaining candies (not necessarily one more than the previous gift).
Return an array (of length num_people and sum candies) that represents the final distribution of candies.
Example 1:
Input: candies = 7, num_people = 4
Output: [1,2,3,1]
Explanation:
On the first turn, ans[0] += 1, and the array is [1,0,0,0].
On the second turn, ans[1] += 2, and the array is [1,2,0,0].
On the third turn, ans[2] += 3, and the array is [1,2,3,0].
On the fourth turn, ans[3] += 1 (because there is only one candy left), and the final array is [1,2,3,1].
Example 2:
Input: candies = 10, num_people = 3
Output: [5,2,3]
Explanation:
On the first turn, ans[0] += 1, and the array is [1,0,0].
On the second turn, ans[1] += 2, and the array is [1,2,0].
On the third turn, ans[2] += 3, and the array is [1,2,3].
On the fourth turn, ans[0] += 4, and the final array is [5,2,3].
Constraints:
- 1 <= candies <= 10^9
- 1 <= num_people <= 1000
題意
按順序分糖果，每次分的個數比上一次多一個(如果不夠則將剩余的全部分掉)，分完最后一個人后再從頭開始分，
思路
直接模擬程序，
代碼實作
Java
class Solution {
public int[] distributeCandies(int candies, int num_people) {
int[] dis = new int[num_people];
int i = 1;
while (candies > 0) {
int num = Math.min(candies, i);
candies -= num;
dis[(i - 1) % num_people] += num;
i++;
}
return dis;
}
}
轉載請註明出處，本文鏈接：https://www.uj5u.com/qita/2190.html
標籤：其他