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

Solution

Method 1 – Simulation

Intuition

We distribute candies in increasing order, looping through people, and giving each the minimum of the next expected amount or the remaining candies. This process is repeated until all candies are distributed.

Approach

Initialize an array ans of size num_people with zeros.
Use a variable give to track the next number of candies to give (starting from 1).
Loop through the people in a round-robin fashion:
- Give min(give, candies) candies to the current person.
- Subtract the given candies from candies.
- Increment give by 1.
- Move to the next person (wrap around if needed).
Stop when all candies are distributed.
Return the ans array.

Code

[{"language":"C++","code":"class Solution {\npublic:\n    vector<int> distributeCandies(int candies, int num_people) {\n        vector<int> ans(num_people, 0);\n        int give = 1, i = 0;\n        while (candies > 0) {\n            int to_give = min(give, candies);\n            ans[i % num_people] += to_give;\n            candies -= to_give;\n            give++;\n            i++;\n        }\n        return ans;\n    }\n};","lang":"cpp"},{"language":"Go","code":"func distributeCandies(candies int, numPeople int) []int {\n    ans := make([]int, numPeople)\n    give, i := 1, 0\n    for candies > 0 {\n        toGive := give\n        if toGive > candies {\n            toGive = candies\n        }\n        ans[i%numPeople] += toGive\n        candies -= toGive\n        give++\n        i++\n    }\n    return ans\n}","lang":"go"},{"language":"Java","code":"class Solution {\n    public int[] distributeCandies(int candies, int num_people) {\n        int[] ans = new int[num_people];\n        int give = 1, i = 0;\n        while (candies > 0) {\n            int toGive = Math.min(give, candies);\n            ans[i % num_people] += toGive;\n            candies -= toGive;\n            give++;\n            i++;\n        }\n        return ans;\n    }\n}","lang":"java"},{"language":"Kotlin","code":"class Solution {\n    fun distributeCandies(candies: Int, numPeople: Int): IntArray {\n        val ans = IntArray(numPeople)\n        var give = 1\n        var i = 0\n        var c = candies\n        while (c > 0) {\n            val toGive = minOf(give, c)\n            ans[i % numPeople] += toGive\n            c -= toGive\n            give++\n            i++\n        }\n        return ans\n    }\n}","lang":"kotlin"},{"language":"Python","code":"class Solution:\n    def distributeCandies(self, candies: int, num_people: int) -> list[int]:\n        ans = [0] * num_people\n        give = 1\n        i = 0\n        while candies > 0:\n            to_give = min(give, candies)\n            ans[i % num_people] += to_give\n            candies -= to_give\n            give += 1\n            i += 1\n        return ans","lang":"python"},{"language":"Rust","code":"impl Solution {\n    pub fn distribute_candies(candies: i32, num_people: i32) -> Vec<i32> {\n        let mut ans = vec![0; num_people as usize];\n        let mut give = 1;\n        let mut c = candies;\n        let mut i = 0;\n        while c > 0 {\n            let to_give = give.min(c);\n            ans[i % num_people as usize] += to_give;\n            c -= to_give;\n            give += 1;\n            i += 1;\n        }\n        ans\n    }\n}","lang

Related Tags