1103.DistributeCandiestoPeople.py

"""
    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:
    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:
    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
"""
#Difficulty: Easy
#27 / 27 test cases passed.
#Runtime: 40 ms
#Memory Usage: 13.9 MB

#Runtime: 40 ms, faster than 73.23% of Python3 online submissions for Distribute Candies to People.
#Memory Usage: 13.9 MB, less than 60.99% of Python3 online submissions for Distribute Candies to People.

class Solution:
    def distributeCandies(self, candies: int, num_people: int) -> List[int]:
        i = 0
        candy = 1
        candies -= candy
        people = [0] * num_people
        while candies >= 0:
            people[i] += candy
            if candies <= candy:
                i += 1
                if i == num_people:
                    i = 0
                people[i] += candies
                break
            candy += 1
            candies -= candy
            i += 1
            if i == num_people:
                i = 0
        return people