![프로그래머스 Lv.0 문자열 잘라서 정렬하기](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdn%2FdotIE6%2FbtsDroawwK2%2FYzXiCHMKafVtk4Vukls4ck%2Fimg.png)
import java.util.*; class Solution { public String[] solution(String myString) { String[] str = myString.split("x+"); String[] answer; // 모두 'x'인 경우 boolean allX = true; for (int i = 0; i < myString.length(); i++) { if (myString.charAt(i) != 'x') { allX = false; break; } } if (allX) { answer = new String[]{""}; } else { answer = Arrays.copyOf(str, str.length); // 빈 문자열 제거 answer = Arrays.stream(..
![프로그래머스 Lv.0 외계행성의 나이](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdn%2FcUhAuv%2FbtsDrI0QXjo%2FVMUbZWjuzlP3bUdWwjYC01%2Fimg.png)
class Solution { public String solution(int age) { String answer = ""; String ageStr = String.valueOf(age); String[] alpha = {"a", "b", "c", "d", "e", "f", "g", "h", "i", "j"}; String[] ageArr = ageStr.split(""); for(int i = 0; i < ageArr.length; i++) { answer += alpha[Integer.parseInt(ageArr[i])]; } return answer; } } 처음에는 alpha 배열에 직접 알파벳을 넣어줬는데, 직접 쓰면 a-j까지 쓰는데 혹시 틀릴 수도 있으니까 for문으로 작성하는 방법으로도..
![프로그래머스 Lv.0 배열 회전시키기](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdn%2FedHmMd%2FbtsDrGvb6OV%2FBkBNGF0sua0aPUKRGH18Y0%2Fimg.png)
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]; System.arraycopy(numbers, 0, answer, 1, numbers.length - 1); } else if (direction.equals("left")) { answer[answer.length-1] = numbers[0]; System.arraycopy(numbers, 1, answer, 0, numbers.length - 1); } return answ..
![프로그래머스 Lv.0 수 조작하기 2](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdn%2FmjEvc%2FbtsDrI0PAnM%2FWn9qA8wVix7YJ2dbtqHxTK%2Fimg.png)
class Solution { public String solution(int[] numLog) { String answer = ""; int num = 0; for(int i = 0; i < numLog.length-1; i++) { if (numLog[i+1] == numLog.length-1) { num = 0 - numLog[i]; } else { num = numLog[i+1] - numLog[i]; } switch(num) { case 1 : answer += "w"; break; case -1 : answer += "s"; break; case 10 : answer += "d"; break; case -10 : answer += "a"; break; } } return answer; } }
![프로그래머스 Lv.0 나이 출력](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdn%2FmMHBV%2FbtsDqO1tpwr%2FE32lnTfN80i5qizArLHNK0%2Fimg.png)
class Solution { public int solution(int age) { int answer = (2022 - age) + 1; return answer; } }