import java.util.*; class Solution { public int solution(int[] array, int n) { Arrays.sort(array); int answer = array[0]; // 일단 첫 번째 요소로 초기화 int minDiff = Math.abs(array[0] - n); // 첫 번째 요소와 n과의 차이 for (int i = 1; i

class Solution { public String solution(String letter) { String answer = ""; String[] morse ={".-","-...","-.-.","-..",".","..-.","--.","....","..",".---","-.-",".-..","--","-.","---",".--.","--.-",".-.","...","-","..-","...-",".--","-..-","-.--","--.."}; String[] tokens = letter.split(" "); for(String token : tokens) { cha..

class Solution { public int[] solution(int[] emergency) { int[] answer = new int[emergency.length]; for(int i=0;i

class Solution { public int[][] solution(int[] num_list, int n) { int[][] answer = new int[num_list.length/n][n]; int cnt=0; for(int i=0;i

class Solution { public String solution(String my_string) { String answer = ""; for(char ch : my_string.toCharArray()) { if(answer.contains(ch+"")) continue; answer+=ch; } return answer; }}

class Solution { public int solution(int num, int k) { int answer = -1; String ns = num+""; String ks = k+""; for(int i=0; i  class Solution { public int solution(int num, int k) { String ns = num+""; String ks = k+""; if(!ns.contains(ks)) return -1; return ns.indexOf(ks)+1; }}  String형 말고 char형으로 할 때는 equals()가 아닌..

class Solution { public int[] solution(int[] numbers, String direction) { int[] answer = new int[numbers.length]; if(direction.equals("right")) { answer[0]=numbers[numbers.length-1]; for(int i=0;i  class Solution { public int[] solution(int[] numbers, String direction) { int[] answer = new int[numbers.length]; if(dire..

class Solution { public String solution(String my_string, String letter) { String answer = ""; answer = my_string.replace(letter,""); return answer; }}