zoukankan      html  css  js  c++  java
  • 1103. Distribute Candies to People (E)

    Distribute Candies to People (E)

    题目

    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

    题意

    按顺序分糖果,每次分的个数比上一次多一个(如果不够则将剩余的全部分掉),分完最后一个人后再从头开始分。

    思路

    直接模拟过程。


    代码实现

    Java

    class Solution {
        public int[] distributeCandies(int candies, int num_people) {
            int[] dis = new int[num_people];
            int i = 1;
            while (candies > 0) {
                int num = Math.min(candies, i);
                candies -= num;
                dis[(i - 1) % num_people] += num;
                i++;
            }
            return dis;
        }
    }
    
  • 相关阅读:
    Js内存泄漏的几种情况
    简单工厂模式
    单例模式
    设计模式简介
    百度地图api-动态添加覆盖物
    ArcGIS发布地图服务后直接调用查看方法
    NetCDF 共享软件 中文
    Oracle服务器重命名
    NETCDF入门
    Oracle11gExpress和PL/SQL Developer安装
  • 原文地址:https://www.cnblogs.com/mapoos/p/13522157.html
Copyright © 2011-2022 走看看