Algorithm


Problem Name: 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:

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
 

Code Examples

#1 Code Example with Java Programming

Code - Java Programming


class Solution {
  public int[] distributeCandies(int candies, int num_people) {
    int[] people = new int[num_people];
    for (int give = 0; candies > 0; candies -= give) {
      people[give % num_people] +=  Math.min(candies, ++give);
    }
    return people;
  }
}
Copy The Code & Try With Live Editor

Input

x
+
cmd
candies = 7, num_people = 4

Output

x
+
cmd
[1,2,3,1]

#2 Code Example with Javascript Programming

Code - Javascript Programming


const distributeCandies = function(candies, num_people) {
  const n = num_people
  const res = Array(n).fill(0)
  let idx = 0, cur = 0
  while(candies > 0) {
    cur++
    res[idx] += Math.min(cur, candies)
    idx++
    candies -= cur
    if(idx === n) idx = 0
  }
  return res
};
Copy The Code & Try With Live Editor

Input

x
+
cmd
candies = 7, num_people = 4

Output

x
+
cmd
[1,2,3,1]

#3 Code Example with Python Programming

Code - Python Programming


class Solution:
    def distributeCandies(self, candies: int, num_people: int) -> List[int]:
        res = [0] * num_people
        i = 0
        while candies > 0:
            res[i % num_people] += min(candies, i + 1)
            i += 1
            candies -= i
        return res
Copy The Code & Try With Live Editor

Input

x
+
cmd
candies = 10, num_people = 3

Output

x
+
cmd
[5,2,3]

#4 Code Example with C# Programming

Code - C# Programming


using System;

namespace LeetCode
{
    public class _1103_DistributeCandiesToPeople
    {
        public int[] DistributeCandies(int candies, int num_people)
        {
            int people = (int)(Math.Sqrt(2 * candies + 0.25) - 0.5);
            int remaining = candies - (people + 1) * people / 2;
            int rows = people / num_people, cols = people % num_people;

            var result = new int[num_people];
            for (int i = 0; i  <  num_people; i++)
            {
                result[i] = (i + 1) * rows + (rows * (rows - 1) / 2) * num_people;
                if (i  <  cols)
                    result[i] += i + 1 + rows * num_people;
            }
            result[cols] += remaining;
            return result;
        }
    }
}
Copy The Code & Try With Live Editor

Input

x
+
cmd
candies = 10, num_people = 3

Output

x
+
cmd
[5,2,3]
Advertisements

Demonstration


Previous
#1096 Leetcode Brace Expansion II Solution in C, C++, Java, JavaScript, Python, C# Leetcode
Next
#1104 Leetcode Path In Zigzag Labelled Binary Tree Solution in C, C++, Java, JavaScript, Python, C# Leetcode