【leetcode】分糖果 II

 

int* distributeCandies(int candies, int num_people, int* returnSize){
    int i=0;
    int* arr = (int*)calloc(num_people,sizeof(int));
    while(candies>0){
        arr[i%num_people]+=(i+1 < candies)?i+1 :candies;
        candies-=(++i);
    }
    *returnSize=num_people;
    return arr;
}