LeetCode知识点总结 - 1103

最新推荐文章于 2022-10-02 15:02:13 发布

jeeeee_no

最新推荐文章于 2022-10-02 15:02:13 发布

阅读量80

点赞数

分类专栏： LeetCode 文章标签： leetcode 算法职场和发展

本文链接：https://blog.csdn.net/m0_59773145/article/details/122356574

版权

LeetCode 专栏收录该内容

417 篇文章 1 订阅

订阅专栏

LeetCode 1103. Distribute Candies to People

考点	难度
Simulation	Easy

题目

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.

思路

用while loop判断是否有剩余的糖，再判断剩余的糖够不够分给下一个人，再分情况讨论。

答案

public int[] distributeCandies(int candies, int num_people) {
        int[] arr = new int[num_people];
        
        int currCandyCount = 1;
        
        while(candies > 0) {
            for(int i = 0; i<num_people; i++) {
                if(candies >= currCandyCount) { 
                    arr[i]+= currCandyCount;
                    candies -=currCandyCount;
                    currCandyCount++;
                } else {
                    arr[i] += candies;
                    candies = 0; 
                }
            }
        }
        return arr;
}