LeetCode --- 1103. Distribute Candies to People 解题思路

杨鑫newlfe

于 2022-03-15 22:43:55 发布

阅读量563

点赞数

分类专栏： Python 算法 LeetCode 文章标签： leetcode 算法 Python 面试

本文链接：https://blog.youkuaiyun.com/u012965373/article/details/123514602

版权

算法同时被 3 个专栏收录

850 篇文章 ¥9.90 ¥99.00

订阅专栏

Python

714 篇文章 ¥9.90 ¥99.00

订阅专栏

LeetCode

438 篇文章

订阅专栏

这篇博客介绍了LeetCode第1103题的解题思路，即如何将一定数量的糖果按照特定规则分发给一排人。通过不断递增糖果数量并从头开始分配，直到糖果分完。文章提供了示例和约束条件，并提到完整代码可在GitHub上获取。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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).

了解本专栏