메델_project

import java.util.*; class Solution { public int[] solution(int[] arr) { ArrayList list = new ArrayList(); int[] copyArr = Arrays.copyOf(arr, arr.length); Arrays.sort(copyArr); int min = copyArr[0]; if(arr.length == 1 && arr[0] == 10 ){ return new int[] {-1}; } for(int i=0; i

import java.util.*; class Solution { public int solution(int left, int right) { int answer = 0; ArrayList numList = new ArrayList(); ArrayList list = new ArrayList(); for(int i= left; i

import java.util.*; class Solution { public String solution(String s) { String answer = ""; String[] arr = s.split(" "); int[] arrNumber = new int [arr.length]; for(int i=0; i

class Solution { public long solution(long price, long money, long count) { long answer = 0; for(int i= 1; i=0){ answer = 0; }else{ answer = Math.abs(money); } return answer; } } 테스트 케이스에서 오류 난다면 오버플로우 먼저 의심해보자 이번주만 두번 경험했다..

import java.util.*; class Solution { public int solution(int[] numbers) { int answer = 0; List numbersList = new ArrayList(); for(int num: numbers){ numbersList.add(num); } for(int i=0; i

class Solution { public boolean solution(int x) { boolean answer = true; int a = x; int sum =0; while(x>0){ sum+= x%10; x = x/10; } if(a%sum == 0){ answer = true; }else{ answer = false; } return answer; } }

import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner kb = new Scanner(System.in); int n = kb.nextInt(); String s = kb.next(); int sum =0; for(char x: s.toCharArray()) { sum+= x-'0'; } System.out.println(sum); } }

import java.util.*; class Solution { public int[] solution(int[] arr, int divisor) { ArrayList list = new ArrayList(); for(int i=0; i

class Solution { public int solution(long num) { int answer = 0; if(num == 1){ answer = 0; } while(num != 1){ if(num%2 == 0){ num = num/2; answer++; }else{ num = num*3+1; answer++; } if(answer==500){ answer = -1; break; } } return answer; } } 테스트 3에서 오류가 났다면 num*3+1 반복하는 과정에서 int형 범위를 초과할 수 있다는 것을 생각하자. int형보다 long 타입을 선언하여 오버플로우를 막아주자.

import java.util.*; class Solution { public long solution(long n) { long answer = 0; StringBuilder sb = new StringBuilder(); String[] list = String.valueOf(n).split(""); Arrays.sort(list); for(String s: list){ sb.append(s); } answer = Long.parseLong(sb.reverse().toString()); return answer; } }