슈콩

[소스 코드]class Main { public int find(int[] parent, int u) { if(u == parent[u]) return u; parent[u] = find(parent, parent[u]); return parent[u]; } public boolean merge(int[] parent, int u, int v) { u = find(parent, u); v = find(parent, v); if(u == v) return true; parent[u] = v; return false; } public int s..

[소스 코드]import java.util.*;class Main { public int solution(int[] enemies, int[] armies) { int answer = 0; Arrays.sort(enemies); Arrays.sort(armies); int a = enemies.length - 1; int b = armies.length - 1; while(b>=0 && a>=0){ if(enemies[a]

[소스 코드]class Main { public String solution(int number) { String answer = ""; int[] numberCount = new int[10]; while(number > 0) { numberCount[number % 10]++; number /= 10; } for(int i = 9; i > 0; i--) if(numberCount[i] != 0) answer += (String.valueOf(i) + String.valueOf(numberCount[i])); return a..

[소스 코드]import java.util.*;class Main { public void swap(int[] numbers, int i, int j) { int tmp = numbers[i]; numbers[i] = numbers[j]; numbers[j] = tmp; } public int[] solution(int[] numbers) { int[] answer = {}; Arrays.sort(numbers); int mid = (numbers.length - 1) / 2; swap(numbers, mid, numbers.length-1); int left = mid + 1; int right = numbers.le..

[소스 코드]class Main { public int solution(int[][] walls) { int answer = 0; for(int i = 0; i walls[j][1]) area = walls[j][1] * (walls[j][0] - walls[i][0]); else area = walls[i][1] * (walls[j][0] - walls[i][0]); if(answer

[소스 코드]class Main { public int solution(int n) { int answer = 0; int[] steps = new int[n+1]; steps[1] = 1; steps[2] = 2; steps[3] = 4; for(int i = 4; i

[소스 코드]// 다음과 같이 import를 사용할 수 있습니다.import java.util.*;class Main { boolean[] prime; public int solution(int a, int b) { // 여기에 코드를 작성해주세요. prime = new boolean[b+1]; prime[0] = prime[1] = true; isPrime(b); int answer = 0; for(int i=2;i=a && sq=a && cube

[소스 코드]// 다음과 같이 import를 사용할 수 있습니다.import java.util.*;class Main { public String solution(int hour, int minute) { // 여기에 코드를 작성해주세요. String answer = ""; double minTotal = minute * 6; double hourTotal = (hour % 12) * 30 + minute * 0.5; double total = Math.abs(hourTotal - minTotal); double finalAngel = Math.min(360-total,total); return String.format("%.1f",fina..

[소스 코드]import java.util.*;class Main { boolean[] visit; List list = new ArrayList(); public int solution(int[] card, int n) { // 여기에 코드를 작성해주세요. int answer = 0; visit = new boolean[card.length]; dfs(0,"",card); Arrays.sort(card); if(list.contains(n)) answer = list.indexOf(n); else answer = -1; return answer; } public void dfs..

[소스 코드]import java.util.Arrays;class Main { class Unit { public int HP; public Unit() { this.HP = 1000; } public void underAttack(int damage) { } } class Monster extends Unit { public int attackPoint; public Monster(int attackPoint) { this.attackPoint = attackPoint; } public void underAttack(int damage) { ..