코딩아 재윤해

import java.util.*; class Solution { public String[] solution(String my_str, int n) { List list = new ArrayList(); for (int i = 0; (i < my_str.length() / n); i++) { list.add(my_str.substring(i * n, n * (i + 1))); } if (my_str.length() % n != 0) { list.add(my_str.substring(my_str.length() / n * n)); } return list.toArray(new String[list.size()]); } }

class Solution { public int solution(int a, int b) { int N = eucd(a, b); int B = b / N; while (B != 1) { if (B % 2 == 0) { B /= 2; } else if (B % 5 == 0) { B /= 5; } else { return 2; } } return 1; } public int eucd(int bigNum, int smallNum) { // 유클리드 호제법 int r = bigNum % smallNum; if (r == 0) { return smallNum; } else { return eucd(smallNum, r); } } }

class Solution { public long solution(String numbers) { numbers = numbers.replace("zero", "0"); numbers = numbers.replace("one", "1"); numbers = numbers.replace("two", "2"); numbers = numbers.replace("three", "3"); numbers = numbers.replace("four", "4"); numbers = numbers.replace("five", "5"); numbers = numbers.replace("six", "6"); numbers = numbers.replace("seven", "7"); numbers = numbers.repla..

class Solution { public int solution(int[] sides) { int A = Math.abs(sides[0] - sides[1]) + 1; int B = Math.abs(sides[0] + sides[1]) - 1; return A >= B ? A - B + 1 : B - A + 1; } }

class Solution { public int solution(String my_string) { String[] arr = my_string.split(" "); int answer = Integer.parseInt(arr[0]); for (int i = 1; i < arr.length; i += 2) { if (arr[i].equals("+")) { answer += Integer.parseInt(arr[i + 1]); } else { answer -= Integer.parseInt(arr[i + 1]); } } return answer; } }

class Solution { public int solution(int chicken) { int answer = 0; int count = chicken; while (count > 9) { answer += count / 10; count = count / 10 + count % 10; } return answer; } }

class Solution { public String solution(String[] id_pw, String[][] db) { String answer = "fail"; for (int i = 0; i < db.length; i++) { if (id_pw[0].equals(db[i][0])) { if (id_pw[1].equals(db[i][1])) { answer = "login"; break; } else { answer = "wrong pw"; break; } } } return answer; } }

class Solution { public int solution(String my_string) { int answer = 0; int curr = 0; boolean isNumber = false; for (int i = 0; i < my_string.length(); i++) { char ch = my_string.charAt(i); if (Character.isDigit(ch)) { curr = curr * 10 + ch - '0'; isNumber = true; } else { if (isNumber) { answer += curr; curr = 0; isNumber = false; } } } if (isNumber) answer += curr; return answer; } }

class Solution { public int solution(String[] spell, String[] dic) { int answer = 2; for(String d : dic) { boolean isHave = true; for(String s : spell) { if(d.indexOf(s) == -1) { isHave = false; break; } } if(isHave) { answer = 1; break; } } return answer; } }

class Solution { public int[] solution(String[] keyinput, int[] board) { int[] answer = new int[2]; int x = board[0] / 2; int y = board[1] / 2; for (String word : keyinput) { if (word.equals("left")) { if (answer[0] != -x) { answer[0]--; } } else if (word.equals("right")) { if (answer[0] != x) { answer[0]++; } } else if (word.equals("up")) { if (answer[1] != y) { answer[1]++; } } else if (word.e..