class Solution { public int[] solution(int[] num_list, int n) { // answer 배열 길이 먼저 구하기 int leng = 0; if(num_list.length % n == 0 ) { leng = num_list.length / n; } else { leng = num_list.length / n + 1; } int[] answer = new int[leng]; int idx = 0; for(int i = 0 ; i < num_list.length; i++) { if ( idx < num_list.length) { answer[i] = num_list[idx]; idx += n; } } return answer; } } class Solution { ..

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; } }