이면지 이면지

public class Solution { public static int[] solution(long n) { int t = 0; long k = n; while(n > 0) { t++; n /= 10; } int[] answer = new int[t]; for (int i = 0; i < t; i++) { answer[i] = (int)(k%10); k /= 10; } return answer; } }

public class Solution { public int solution(int[] numbers) { int answer = 45; for (int tmp : numbers) { answer -= tmp; } return answer; } }

import java.util.*; // 프로그래머스 - 모의고사 42840 public class Solution { public static int[] solution(int[] answers) { int k = 0, j = 0, aSize = answers.length, aMax = 0; int[] first = new int[aSize], second = new int[aSize], third = new int[aSize], n = new int[3]; for (int i : answers) { first[k] = k % 5 + 1; if (k % 2 != 0 && k/2 % 4 == 0) { second[k] = 1; } else second[k] = k % 2 == 0 ? 2 : k/2 % 4..

// 프로그래머스 정수 제곱근 판별 (12934) public class Solution { public static long solution(long n) { double result = Math.sqrt(n); long answer; if (result % 1 == 0) { answer = (long) Math.pow(result + 1, 2); return answer; } else { answer = -1; } return answer; } }

import java.util.ArrayList; import java.util.Arrays; // 12919 public class Solution { public String solution(String[] seoul) { ArrayList strList = new ArrayList(Arrays.asList(seoul)); int n = strList.indexOf("Kim"); String answer = "김서방은 " + n + "에 있다"; return answer; } }

public class P12948 { public static String solution(String phone_number) { int size = phone_number.length(); String last = phone_number.substring(size - 4); String answer = new String(); for (int i = 0; i < size - 4; i++) { answer = answer + "*"; } answer = answer + last; return answer; } }

import java.util.Arrays; public class P12917 { public static String solution(String s) { char[] arr = s.toCharArray(); Arrays.sort(arr); for (int i = 0; i < arr.length/2; i++) { char temp = arr[i]; arr[i] = arr[arr.length - i - 1]; arr[arr.length - i - 1] = temp; } String answer = new String(arr); System.out.println(answer); return answer; } }

같은 숫자는 싫어 12906 //프로그래머스 - 같은 숫자는 싫어 (12906) import java.util.*; import java.util.stream.*; public class Solution { public static int[] solution(int[] arr) { List arrList = Arrays.stream(arr).boxed().collect(Collectors.toList()); // List 변환 List rm = new ArrayList(); int tmp = 0; for (int i = 0; i < arrList.size() - 1; i++) { if (arrList.get(i) == arrList.get(i + 1)) { arrList.set(i, -1); } } rm..