안녕하세요. 오늘은 프로그래머스의 최고의 집합문제를 풀어보겠습니다!
https://programmers.co.kr/learn/courses/30/lessons/12938
import java.util.*;
class Solution {
public int[] solution(int n, int s) {
int[] answer;
int divRes = 0;
int remainder = 0;
boolean bool = false;
if(s/n == 0) {
answer = new int[]{-1};
bool = true;
} else {
answer = new int[n];
divRes = s/n;
remainder = s-divRes*n;
}
if (remainder == 0 && !bool) {
for (int i = 0; i < answer.length; i++) {
answer[i] = divRes;
}
} else if(remainder !=0 && !bool) {
for (int i = answer.length-1; i >=0; i--) {
if(remainder != 0){
answer[i] = divRes + 1;
remainder--;
} else {
answer[i] = divRes;
}
}
}
return answer;
}
}