LeetCode 1103. Distribute Candies to People (Java版; Easy)

内容导读

互联网集市收集整理的这篇技术教程文章主要介绍了LeetCode 1103. Distribute Candies to People (Java版; Easy)，小编现在分享给大家，供广大互联网技能从业者学习和参考。文章包含1985字，纯文字阅读大概需要3分钟。

内容图文

welcome to my blog

LeetCode 1103. Distribute Candies to People (Java版; 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.

?

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

第一次做; 最朴素的做法, 通过循环模拟相加的过程; 核心: 循环条件, 剩余糖果数量不小于count

/*
最朴素的方法: 模拟一遍这个过程
*/
class Solution {
    public int[] distributeCandies(int candies, int num_people) {
        int[] arr = new int[num_people];
        int i = 0, count=1;
        while(candies>=count){
            arr[i] += count;
            //update
            i++;
            if(i==num_people)
                i=0;
            candies -= count;
            count++;
        }
        if(candies>0)
            arr[i] += candies;
        return arr;
    }
}

内容总结

以上是互联网集市为您收集整理的LeetCode 1103. Distribute Candies to People (Java版; Easy)全部内容，希望文章能够帮你解决LeetCode 1103. Distribute Candies to People (Java版; Easy)所遇到的程序开发问题。 如果觉得互联网集市技术教程内容还不错，欢迎将互联网集市网站推荐给程序员好友。

内容备注

版权声明：本文内容由互联网用户自发贡献，该文观点与技术仅代表作者本人。本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容， 请发送邮件至 gblab@vip.qq.com 举报，一经查实，本站将立刻删除。

内容手机端