DataStructure&Algorithm (52) 썸네일형 리스트형 [DataStructure&Algorithm] 이분 검색 section : searching 풀이 1 import java.util.Arrays; import java.util.Scanner; public class Main { public int solution(int a, int b, int[] arr){ int answer = 0, p1 = 0, p2 = a-1;; Arrays.sort(arr); while(p1b) { p2 = mid - 1; } else { p1 = mid + 1; } } return answer; } public static void main(String[] args){ Main m = new Main(); Scanner scanner = new Scanner(System.in); int a = scanner.nextInt(); in.. [DataStructure&Algorithm] 좌표 정렬 section : sorting 풀이 1 import java.util.ArrayList; import java.util.Collections; import java.util.Scanner; class Point implements Comparable{ public int x, y; Point(int x, int y){ this.x=x; this.y=y; } public int compareTo(Point o) { if (this.x == o.x) return this.y - o.y; else return this.x-o.x; } } public class Main { public static void main(String[] args){ Scanner scanner = new Scanner(System.. [DataStructure&Algorithm] 장난꾸러기 section : sorting 풀이 1 import java.util.ArrayList; import java.util.Arrays; import java.util.Scanner; public class Main { public ArrayList solution(int n, int[] arr){ ArrayList answer = new ArrayList(); int[] tmp = arr.clone(); Arrays.sort(tmp); for(int i=0; i [DataStructure&Algorithm] 중복 확인 section : sorting 풀이 1 import java.util.Arrays; import java.util.Scanner; public class Main { public String solution(int n, int[] arr){ Arrays.sort(arr); for(int i=0; i [DataStructure&Algorithm] least recently used section : sorting 풀이 1 import java.util.Scanner; public class Main { public int[] solution(int s, int n, int[] arr){ int[] cache = new int[s]; for(int x : arr){ int tmp = -1; for(int i=0; i0; i--){ cache[i] = cache[i-1]; } } else { for(int i=tmp; i>0; i--){ cache[i] = cache[i-1]; } } cache[0]=x; } return cache; } public static void main(String[] args){ Main m = new Main(); Scanner scanner = new .. [DataStructure&Algorithm] 삽입 정렬 section : sorting 풀이 1 import java.util.Scanner; public class Main { public int[] solution(int a, int[] arr){ for(int i=1; i=0; j--) { if (arr[j] > tmp) arr[j+1] = arr[j]; else break; } arr[j+1] = tmp; } return arr; } public static void main(String[] args){ Main m = new Main(); Scanner scanner = new Scanner(System.in); int a = scanner.nextInt(); int[] arr = new int[a]; for(int i=0; i [DataStructure&Algorighm] 버블 정렬 section : sorting 풀이 1 import java.util.Scanner; public class Main { public int[] solution(int a, int[] arr){ for(int i=0; i [DataStructure&Algorithm] 선택 정렬 section : sorting 풀이 1 import java.util.Scanner; public class Main { public int[] solution(int a, int[] arr){ for(int i=0; i 이전 1 2 3 4 ··· 7 다음