배열 회전시키시(프로그래머스)
·
Codding_Test/Programmers
import java.util.*; class Solution { public int[] solution(int[] numbers, String direction) { int[] answer = new int[numbers.length]; Deque dq = new LinkedList(); for(int i : numbers){ dq.add(i); } if(direction.contains("right")){ dq.addFirst(dq.removeLast()); }else { dq.addLast(dq.removeFirst()); } for (int i = 0; i < numbers.length; i++) { answer[i] += dq.pop(); } return answer; } }
한 번만 등장한 문자(프로그래머스)
·
Codding_Test/Programmers
import java.util.*; class Solution { public String solution(String s) { String answer =""; char [] carr = s.toCharArray(); Hashtable hs = new Hashtable(); for (char c : carr){ hs.put(c, hs.getOrDefault(c, 0) + 1); } List list = new ArrayList(hs.keySet()); Collections.sort(list); for (Character key : list){ if(hs.get(key) == 1){ answer += key; } } return answer; } }
문자열안에 문자열 (프로그래머스)
·
Codding_Test/Programmers
class Solution { public int solution(String str1, String str2) { return str1.contains(str2) ? 1 : 2; } }