[JAVA/코딩테스트] 최고의 집합

문제

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

프로그래머스

 

 

class Solution {
      public int[] solution(int n, int s) {
        int[] answer = {};

        if(s/n < 1){
            answer = new int[]{-1};
        }else{
            answer = new int[n];

            if(s%n == 0){
                for(int i=0; i<answer.length; i++){
                    answer[i] = s/n;
                }
            }else{
                for(int i=0; i<answer.length; i++){
                    answer[i] = s/n;
                }
                int c = s%n;
                for(int i = 0; i < c; i ++){
                    answer[answer.length-1-i] += 1;
                }

            }
        }
        return answer;
    }
}