코딩아 재윤해

import java.util.*; class Solution { public int[] solution(int[] arr) { if(arr.length == 1) return new int[]{-1}; int[] clone = arr.clone(); Arrays.sort(clone); int min = clone[0]; int[] answer = new int[arr.length - 1]; int i = 0; int j = 0; while (i < arr.length) { if (arr[i] != min) { answer[j] = arr[i]; i++; j++; } else i++; } return answer; } }

import java.util.*; class Solution { public int[] solution(int[] arr, int divisor) { List list = new ArrayList(); for (int i : arr) { if (i % divisor == 0) list.add(i); } if (list.isEmpty()) list.add(-1); int[] answer = new int[list.size()]; for (int i = 0; i < list.size(); i++) { answer[i] = list.get(i); } Arrays.sort(answer); return answer; } }

class Solution { public int solution(int num) { long n = num; int answer = 0; while (n > 1) { if (answer == 500) return -1; if (n % 2 == 0) { n /= 2; answer++; } else { n = n * 3 + 1; answer++; } } return answer; } }

class Solution { public long solution(int a, int b) { long answer = 0; if (a > b) { for (int i = b; i

class Solution { public int solution(int n) { if (n % 2 == 1) return 2; int i = 2; while (true) { if (n % i == 1) break; i++; } return i; } }

import java.util.*; class Solution { public long solution(long n) { String[] arr = Long.toString(n).split(""); Arrays.sort(arr, Collections.reverseOrder()); return Long.parseLong(String.join("", arr)); } }

class Solution { public long[] solution(int x, int n) { long[] answer = new long[n]; answer[0] = x; for (int i = 1; i < answer.length; i++) { answer[i] = answer[i - 1] + x; } return answer; } }

class Solution { public long solution(long n) { Double num = Math.sqrt(n); return num == num.intValue() ? (long)Math.pow(num + 1, 2) : -1; } }

class Solution { boolean solution(String s) { char[] arr = s.toUpperCase().toCharArray(); int P = 0; int Y = 0; for (char ch : arr) { if (ch == 'P') P++; if (ch == 'Y') Y++; } return P == Y ? true : false; } }

class Solution { public int[] solution(long n) { String str = String.valueOf(n); int[] answer = new int[str.length()]; int count = 0; while (n > 0) { answer[count] = (int)(n % 10); n /= 10; count++; } return answer; } }