LeetCode 1103

leetcode-cn.com/problems/di…

class Solution {
    fun distributeCandies(candies: Int, num_people: Int): IntArray {
        val array = Array(num_people) { 0 }
        var can = candies
        var curLoc = 0
        var curNum = 1
        while (can > 0) {
            array[curLoc % num_people] = array[curLoc % num_people] + curNum
            can -= curNum
            curNum++
            if (curNum > can) curNum = can
            curLoc++
        }
        return array.toIntArray()
    }
}