kingsubin kingsubin

class Solution { public int solution(String s) { return Integer.valueOf(s); } } - 성공 - 그냥 Integer.valueOf 함수가 생각났다

class Solution { public String solution(int n) { String su = "수"; String bak = "박"; StringBuffer answer = new StringBuffer(); if (n == 1) { return su; } if (n % 2 == 0) { for (int i = 0; i < n/2; i++) { answer.append(su); answer.append(bak); } } else { for (int i = 0; i < n/2; i++) { answer.append(su); answer.append(bak); } answer.append(su); } return answer.toString(); } } - 성공 - 쉬운문젠데 어렵게 푼거 같..

class Solution { public static int solution(int n) { int count = 0; for (int i = 2; i

import java.util.Arrays; import java.util.Collections; class Solution { public static String solution(String s) { Character[] answer = new Character[s.length()]; String answer1 = ""; for (int i = 0; i < answer.length; i++) { answer[i] = s.charAt(i); } Arrays.sort(answer, Collections.reverseOrder()); for (int i = 0; i < answer.length; i++) { answer1 += Character.toString(answer[i]); } return answ..

class Solution { boolean solution(String s) { String lower = s.toLowerCase(); int pcnt = 1; int ycnt = 0; for (int i = 0; i < lower.length(); i++) { if (lower.charAt(i) == 'p') { pcnt++; } if (lower.charAt(i) == 'y') { ycnt++; } } return (pcnt-1) == ycnt; } } - 성공 - p,y 둘 다 안나오는 경우도 있으니 pcnt = 1로 주고 풀이 class Solution { boolean solution(String s) { s = s.toLowerCase(); int count = 0; for (int i =..

import java.util.Arrays; import java.util.Comparator; class Solution { public String[] solution(String[] strings, int n) { Arrays.sort(strings, new Comparator() { @Override public int compare(String o1, String o2) { if (o1.charAt(n) == o2.charAt(n)) { return o1.compareTo(o2); } else { return o1.charAt(n) - o2.charAt(n); } } }); return strings; } } - 성공 - 저번에 Comparator 쓰는 문제를 풀어봤더니 문제읽고 이거 써야겠다는..

class Solution { public long solution(int a, int b) { long big = Math.max(a, b); long small = Math.min(a, b); long answer = 0; for (long i = small; i

import java.util.ArrayList; import java.util.Arrays; class Solution { public int[] solution(int[] arr, int divisor) { ArrayList list = new ArrayList(); for (int i = 0; i < arr.length; i++) { if (arr[i] % divisor == 0) { list.add(arr[i]); } } if (list.size() == 0) { list.add(-1); } int[] answer = new int[list.size()]; for (int i = 0; i < list.size(); i++) { answer[i] = list.get(i); } Arrays.sort(..