Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- import static java.lang.System.out;
- public class QueueLab3 {
- public static void main(String[] args) {
- MyQueue q=new MyQueue();
- q.add(1);
- q.add(2);
- q.add(3);
- q.add(4);
- q.add(5);
- q.add(6);
- q.remove();
- q.remove();
- q.remove();
- q.remove();
- q.remove();
- q.display();
- }
- }
- class MyQueue
- {
- private int list[];
- private int front;
- private int back;
- private int capacity;
- private int size;
- private boolean isFull()
- {
- if (back +1 == front)
- return true;
- else
- return false;
- }
- private void resize()
- {
- int list2[]=new int[list.length*2];
- for(int k=0;k<list.length;k++)
- list2[k]=list[k];
- capacity=list.length*2;
- list=list2;
- }
- public MyQueue() {
- list=new int[4];
- back=0;
- front=0;
- size=0;
- capacity=4;
- }
- public boolean isEmpty()
- {
- return (size==0);
- }
- public void add(int item)
- {
- size++;
- if (back==0) {
- list[0] = item;
- back++;
- }
- else if (back==list.length-1)
- {
- resize();
- list[back]=item;
- back++;
- }
- else {
- list[back] = item;
- back++;
- }
- }
- public int remove()
- {
- if(size-1>=0) {
- size--;
- int temp=back;
- back--;
- return list[temp];
- }
- else
- out.println("The queue is already empty .. i cant remove stuff out of thin air... smh");
- return -999;
- }
- public int peek()
- {
- return list[front];
- }
- public int getSize()
- {
- return list.length;
- }
- public void display()
- {
- if (front== back)
- out.println("dont print out an empty queue.. ITS EMPTY MANN..");
- else
- for (int k=0; k<=back-1;k++)
- {
- out.print(list[k]+ " ");
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement