코딩응급실

import java.util.Scanner; class Solution { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int a = sc.nextInt(); int b = sc.nextInt(); for (int x=0; x

class Solution { public long[] solution(int x, int n) { long[] answer = new long[n]; for (int y=0; y

class Solution { public int[][] solution(int[][] arr1, int[][] arr2) { int[][] answer = new int[arr1.length][arr1[0].length]; for (int x=0; x

class Solution { public String solution(String phone_number) { String answer = ""; for (int x=0; x phone_number.length() - 4) { answer += phone_number.charAt(x); } else { answer += "*"; } } return answer; } public static void main(String[] args) { String phone_number = "01033334444"; Solution sol = new Solution(); String result = sol.solution(phone_number); System.out.println(result); } } 아래는 더 ..

class Solution { public boolean solution(int n) { int num = n; int sum = 0; while (n != 0) { sum += n % 10; n /= 10; } if (num % sum == 0) { return true; } else { return false; } } public static void main(String[] args) { int x = 11; Solution sol = new Solution(); boolean result = sol.solution(x); System.out.println(result); } }

class Solution { public double solution(int[] arr) { int len = arr.length; int sum = 0; for (int x=0; x

class Solution { public int solution(int number) { long num = number; // 이거 없어서 계속 틀렸음... long으로 해야 큰 수일 때도 처리가능 int ans = 0; while (num != 1) { if (num % 2 == 0) { num /= 2; } else { num = num * 3 + 1; } ans++; if (ans == 500) { return -1; } } return ans; } public static void main(String[] args) { int n = 626331; Solution sol = new Solution(); int result = sol.solution(n); System.out.println(re..

class Solution { public int[] solution(int n, int m) { int[] answer = new int[2]; int big; /* int GCD; // Greatest Common Divisor int LCM; // Least Common Multiple */ if (n > m) { big = n; } else { big = m; } for (int x=1; x