1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70
| package test;
import java.util.*;
public class CollectionTest {
public static void testStack(){ Deque<Integer> stack = new ArrayDeque<>();
stack.push(1);
Integer a = stack.peek();
stack.pop(); }
public static void testQueue(){ Queue<Integer> q = new LinkedList<>(); q.offer(1); Integer a = q.poll(); Integer b = q.peek(); }
public static void testDeque(){ Deque<Integer> deque = new LinkedList<>(); deque.addLast(3); deque.addFirst(1);
Integer a = deque.getFirst(); Integer b = deque.getLast();
deque.removeLast(); deque.removeFirst();
}
public static void testPriorityQueue(){
PriorityQueue<Integer> q = new PriorityQueue<>((o1, o2) -> o2 - o1);
q.add(2);
Integer a = q.peek(); Integer b = q.poll();
q.remove(3); q.remove();
} }
|