Java - Queue Stack

import java.math.*;
import java.util.*;
import java.io.*;
public class Main 
{
	public static void main(String args[])
	{
		Scanner cin=new Scanner(System.in);
		System.out.println();
		int x=0;
		Stack<Integer> s=new Stack<Integer>();
		PriorityQueue pQ = new PriorityQueue(); 
		Queue<Integer> q = new LinkedList<Integer>();
		PriorityQueue<Integer> Q=new PriorityQueue();
		Deque<Integer> Dq=new LinkedList<Integer>();
		
		Dq.addFirst(x);
		Dq.addLast(x);
		Dq.pollFirst();
		Dq.pollLast();
		
		pQ.add(x);
		pQ.poll();
		pQ.size();
		pQ.clear();
		
		s.add(x);
		s.size();
		s.clear();
		s.peek();s.pop();s.push(x);
		if(!s.isEmpty())
			s.push(x);
		q.peek();//头
		q.clear();
		q.size();
		q.add(x);
		if(!q.isEmpty());
			q.remove();
	}
}