programmers_최고의 집합_java

https://school.programmers.co.kr/learn/courses/30/lessons/12938

프로그래머스

class Solution {
    public int[] solution(int n, int s) {
        int[] answer;
        
        if(n > s){
            answer = new int[1];
            answer[0] = -1;
        }else{
            answer = new int[n];
            int quotient = s/n;
            int remain = s%n;
            for(int i = 0; i<n; i++){
                answer[i] = quotient;
            }
            int idx = n-1;
            while(remain > 0){
                answer[idx--]+=1;
                if(idx <0 ) idx = n-1;
                remain--;
            }
        }

        return answer;
    }
}