
import java.util.*;
class Solution {
public int[] solution(int[] num_list) {
Arrays.sort(num_list);
ArrayList<Integer> list = new ArrayList<>();
for (int i = 5; i < num_list.length; i++) {
list.add(num_list[i]);
}
int[] answer = new int[list.size()];
for (int i = 0; i < list.size(); i++) {
answer[i] = list.get(i);
}
return answer;
}
}
매개변수 배열에서 가장 작은 5개를 제외한 나머지 값을 오름차순한 리스트를 리턴하는 문제

import java.util.*;
class Solution {
public int solution(int[] rank, boolean[] attendance) {
ArrayList<Integer> selectedIndices = new ArrayList<>();
for (int i = 0; i < rank.length; i++) {
if (attendance[i]) {
selectedIndices.add(i);
}
}
selectedIndices.sort((a, b) -> Integer.compare(rank[a], rank[b]));
int a = selectedIndices.get(0);
int b = selectedIndices.get(1);
int c = selectedIndices.get(2);
int result = 10000 * a + 100 * b + c;
return result;
}
}
조건

class Solution {
public int solution(double flo) {
return (int) flo;
}
}

class Solution {
public int solution(String num_str) {
int answer = 0;
String[] numArr= num_str.split("");
for (String num : numArr){
answer+=Integer.parseInt(num);
}
return answer;
}
}

public class Solution {
public int solution(String n_str) {
return Integer.parseInt(n_str);
}
}