leetcode 1103. Distribute Candies to People

最新推荐文章于 2026-06-15 07:00:00 发布

原创最新推荐文章于 2026-06-15 07:00:00 发布 · 155 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

本文介绍了一个有趣的问题，如何将有限数量的糖果按照规律分配给一排人，每次分配数量逐次增加，直至最后一人得到剩余所有糖果。通过编程解决这个过程并给出了Python代码实例。

Distribute Candies to People

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

自己写的：（暴力

class Solution:
    def distributeCandies(self, candies: int, num_people: int) -> List[int]:
        pp = [0] * num_people
        give = 1
        i = 0
        while candies > 0:
            if i > num_people - 1:
                i = 0	# 改成pp[i % num_people]就好了
            if give > candies:
                give = candies # 连give这歌变量都不需要， 直接每次给出 min(i + 1, candies) 若i + 1更小就出i+ 1；candies不够了就出candies
            pp[i] += give
            i += 1
            candies -= give
            give += 1
        return pp

接受官方教育：

ans = [0] * num_people
        i = 0
        while candies != 0:
            ans[i % num_people] += min(i + 1, candies)
            candies -= min(i + 1, candies)
            i += 1
        return ans