LeetCode --- 1103. Distribute Candies to People 解题思路
Posted 杨鑫newlfe
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了LeetCode --- 1103. 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:
In
以上是关于LeetCode --- 1103. Distribute Candies to People 解题思路的主要内容,如果未能解决你的问题,请参考以下文章
LeetCode --- 1103. Distribute Candies to People 解题思路
LeetCode.1103-向人们分发糖果(Distribute Candies to People)
Leetcode 1103. Distribute Candies to People