슈콩

[소스 코드]import java.util.*;class Main { public int solution(int K, String[] words) { int answer = 1; int len = 0; for(int i=0;i

[소스 코드]import java.util.*;class Main { public int[] dr = {-1,1,0,0}; public int[] dc = {0,0,-1,1}; public int solution(int n, int[][] garden) { int answer = 0; Queue q = new LinkedList(); boolean[][] visit = new boolean[n][n]; for(int i=0;i=n || nc=n || visit[nr][nc]) continue; visit[nr][nc] = true; q.offer(new int[]{nr,nc}); check =..

[소스 코드]class Main { class Job { public int salary; public Job() { this.salary = 0; } public int getSalary() { return salary; } } class PartTimeJob extends Job { public int workHour, payPerHour; public PartTimeJob(int workHour, int payPerHour) { this.workHour = workHour; this.payPerHour =..

[소스 코드]import java.util.*;class Main { public int solution(int number, int target) { int answer = 0; Queue q = new LinkedList(); boolean[] visit = new boolean[30000]; q.offer(new int[]{number,0}); visit[number] = true; while(!q.isEmpty()){ int[] curr = q.poll(); if(curr[0]==target){ answer = curr[1]; break; } else{ if(!visit[curr[0]+1]){ q.offer(new int[]{curr[0]+1,..

[소스 코드]class Main { public int func_a(int a, int b) { int mod = a % b; while(mod > 0) { a = b; b = mod; mod = a % b; } return b; } public int func_b(int n) { int answer = 0; for(int i = 1; i

[소스 코드]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