7/18/2019 Deques

1/1

********************************************************************************************************************CODE-1********************************************************************************************************************public class Deque { private LinkedList deque = new LinkedList(); public void addFirst(T e) { deque.addFirst(e); } public void addLast(T e) { deque.addLast(e); } public T getFirst() { return deque.getFirst(); } public T getLast() { return deque.getLast(); } public T removeFirst() { return deque.removeFirst(); } public T removeLast() { return deque.removeLast(); } public int size() { return deque.size(); } public String toString() { return deque.toString(); } // And other methods as necessary...}

public class DequeTest { static void fillTest(Deque deque) { for(int i = 20; i < 27; i++) deque.addFirst(i); for(int i = 50; i < 55; i++) deque.addLast(i);

} public static void main(String[] args) { Deque di = new Deque(); fillTest(di); print(di); while(di.size() != 0) printnb(di.removeFirst() + " "); print(); fillTest(di); while(di.size() != 0) printnb(di.removeLast() + " "); }}