LeetCode高频面试60天打卡日记Day05

Day05

暴力解题
class Solution {
    
    
    public int[] distributeCandies(int candies, int num_people) {
    
    
        int[] ans = new int[num_people];
        int i = 0;
        while(candies!=0){
    
    
            ans[i%num_people] += Math.min(candies,i+1);  //这里i%num_people用来多次循环数组
            candies -= Math.min(candies,i+1);
            i +=1;
        }
        return ans;
    }
}