class Solution { public int[] solution(int[] arr) { // 배열 길이 먼저 구하고 int cnt = 0; for(int i = 0; i 0) { answer[idx++] = arr[i]; repeat--; } } return answer; } }

class Solution { public int solution(int[] num_list) { int answer = 0; String odd = ""; String even = ""; for(int i = 0; i < num_list.length; i++) { if(num_list[i] % 2 == 0) { even += Integer.toString(num_list[i]); } else { odd += Integer.toString(num_list[i]); } } answer = Integer.parseInt(even) + Integer.parseInt(odd); return answer; } }

class Solution { public String solution(int n) { String answer = Integer.toString(n); return answer; } }

class Solution { public int solution(String my_string, String target) { int answer = 0; if(my_string.contains(target)) { answer = 1; } return answer; } }

class Solution { public String solution(String[] str_list, String ex) { String answer = ""; for(int i = 0; i < str_list.length; i++) { if(str_list[i].contains(ex)) { continue; } else { answer += str_list[i]; } } return answer; } }