class Solution { public String solution(String myString) { String answer = ""; myString = myString.replace(myString, myString.toLowerCase()); answer = myString.replace("a", "A"); return answer; } }

class Solution { public int solution(int[] arr, int idx) { int answer = -1; for(int i = 0; i = idx && arr[i] == 1) { answer = i; break; } } return answer; } }

class Solution { public int[] solution(int[] arr, int[] delete_list) { // arr의 원소 중 delete_list의 원소와 같다면 숫자 0으로 바꿔주고 count // answer.lengt = arr.length - count int count = 0; for(int i = 0; i < arr.length; i++) { for(int j = 0; j < delete_list.length; j++) { if(arr[i] == delete_list[j]) { arr[i] = 0; count++; } } } // answer에 넣기 int[] answer = new int [arr.length-count]; int idx = 0; for(int i =..

class Solution { public int solution(int[] numbers) { int answer = 0; for(int i = 0; i numbers[j]) { int tmp = numbers[i]; numbers[i] = numbers[j]; numbers[j] = tmp; } } } int maxIdx = numbers[numbers.length-1] * numbers[numbers.length-2]; int minIdx = numbers[0] * numbers[1]; return answer = (maxIdx > minIdx..

class Solution { public String[] solution(String[] strArr) { String[] answer = new String [strArr.length]; for(int i = 0; i < strArr.length; i++) { if(i % 2 == 0 || i == 0) { answer[i] = strArr[i].replace(strArr[i] ,strArr[i].toLowerCase()); } else { answer[i] = strArr[i].replace(strArr[i], strArr[i].toUpperCase()); } } return answer; } }