Developer MJ

Priority Queue(우선순위 큐) push, pop, show import java.util.Scanner; class Item { int data; Item(int _data) { data = _data; } } public class PriorityQueue { final static int MAX_QUEUE_SIZE = 100; static int heapSize = 0; static Item[] heap = new Item[MAX_QUEUE_SIZE]; static void initHeap() { heapSize = 0; } static boolean isFull() { if (heapSize + 1 > MAX_QUEUE_SIZE) { System.out.println("PQ is full..

더블 링크드 리스트 insert, extract ( remove ), show 구현 import java.util.Scanner; class Node { int data; Node prev; Node next; Node(int _data) { data = _data; } static void insert(Node _head, Node _node) { Node next = _head.next; _head.next = _node; _node.prev = _head; if (next != null) { next.prev = _node; _node.next = next; } } static Node extract(Node _head, int _data) { Node current = _head.next; whi..

먼저 집어 넣은 데이터가 먼저 나오는 FIFO (First In First Out)구조 N(2= MAX_N) { rear = MAX_N; } return value; } public static void main(String arg[]) throws Exception { Scanner sc = new Scanner(System.in); int T = sc.nextInt(); for (int test_case = 1; test_case

한 쪽 끝에서만 자료를 넣거나 뺄 수 있는 선형 구조(LIFO - Last In First Out) N(2