LIPNUS

class Li{ class Node{ Node prev; Node next; T data; Node(T data){ this.data = data; } } Node head; Node tail; int size=0; void add(T e){ Node newNode = new Node(e); if(size==0){ head = newNode; tail = newNode; }else{ head.prev = newNode; newNode.next = head; head = newNode; } size++; } } find는 head가지고 와서 직접하면 될듯.

package 큐구현; import java.util.NoSuchElementException; class Queue{ class Node{ private Node next; private T data; public Node(T data){ this.data = data; } } private Node start; private Node end; public void add(T item){ Node node = new Node(item); if(end!=null){ end.next = node; } end = node; if(start==null){ start = node; } } public T pull(){ if(start==null){ throw new NoSuchElementException();..

이진탐색트리(BST, Binary Search Tree)참고: https://www.youtube.com/watch?v=xxADG17SveY package BST; public class Main { public static void main(String[] args){ BST tree= new BST(); tree.insert(4); tree.insert(2); tree.insert(1); tree.insert(3); tree.insert(6); tree.insert(5); tree.insert(7); tree.inorder(); tree.delete(7); tree.inorder(); } } class BST{ class Node{ Node left; Node right; int data; Node(..

병합정렬 참고:https://www.youtube.com/watch?v=QAyl79dCO_k public class Main { static int[] arr = {3,9,4,7,5,0,1,6,8,2}; public static void main(String[] args){ print(arr); int[] temp = new int[arr.length]; meargeSort(arr, temp, 0, arr.length-1); print(arr); } static void meargeSort(int[] arr, int[] temp, int start, int end){ if(start

백트리킹을 재귀를 이용해서 3가지 방법으로 구현 3칸에 1~4를 중복해서 넣어서 나오는 경우의 수3번째 방법이 가장 간결한 것 같다. package 테스트; import java.util.LinkedList; import java.util.List; import java.util.Stack; public class Main { public static void main(String[] args) { //재귀 첫번째 for(int i=1; i

백준 10828 스택https://www.acmicpc.net/problem/10828 package 스택; import java.io.BufferedReader; import java.io.InputStreamReader; public class Main { static int N; //명령어의 수 static int[] stack = new int[10001]; static int cursor = 0; public static void main(String[] args) throws Exception{ BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); N = Integer.parseInt(br.readLine()); f..

Priority Queue(우선순위 큐) import java.util.Scanner; public class Main { static int[] heap; static int MAX_SIZE=100; static int size; static int T; static int N; public static void main(String[] args){ heap = new int[MAX_SIZE+1]; //1부터 채운다 Scanner sc = new Scanner(System.in); T = sc.nextInt(); for(int t=1; t

퀵소트public class Main { public static void main(String[] args){ int arr[] = {3,9,4,7,5,5,0,1,6,8,2}; print(arr); System.out.println(); quickSort(arr); print(arr); } public static void quickSort(int[] arr){ quickSort(arr, 0, arr.length-1); } public static void quickSort(int[] arr, int start, int end){ int part2 = partition(arr, start, end); //오른쪽 파티션의 첫번째 인덱스 //각 파티션은 적어도 2개이어야 한다(1개면 끝나서 더이상 할 필요..

Java.Util 사용하지 않고 Hash구현 https://www.swexpertacademy.com/main/code/referenceCode/referenceCodeDetail.do?referenceId=HASH&category=DataStructure HashTable Classpublic class HashTable { class Hash{ String key; String data; } int capacity = 0; Hash[] table; /** * 생성자 * @param capacity */ public HashTable(int capacity){ this.capacity = capacity; table = new Hash[capacity]; for(int i=0; i