HactoberFest/ArrayQueue.java at master · Yashika13/HactoberFest · GitHub

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
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
import java.util.Scanner;
//This is an implementation of circular queue using arrays
//Queue is a FIFO data structure
class queue
{
	int size;
	int front;
	int rear;
	int q[];

	//to intialize queue
	queue(int N)
	{
		size=N;
		front=rear=-1;
		q=new int[size];
	}

	// to add element to queue
	void enqueue(int x)
	{
		if((front==rear)&&(rear==-1))
			front=rear=0;
		else if((rear+1)%size==front%size)
			return;
		else
		{
			rear=(rear+1)%size;
		}
		q[rear]=x;

	}

	//to remove element from queue
	int dequeue()
	{
		if(front==-1)
			return -1;
		else
			{
			int data=q[front];

		    front=(front+1)%size;

		    return data;}
	}

	void display()
	{
		//System.out.println(rear+ " "+ front);
		if(front==-1)
			return;
		else
		{
			int i=front;
			while(i!=rear)
			{

				System.out.print(q[i]+" ");
					i=(i+1)%size;
			}
			System.out.print(q[rear]);
		}
	}
}

public class ArrayQueue
{
	public static void main(String[] args)
    {
        Scanner sc = new Scanner(System.in);
        int N=sc.nextInt();
        queue myq= new queue(N);
        for(int i=0;i<N;i++)
        {
        	myq.enqueue(sc.nextInt());

        }
       // myq.display();
        int n1=sc.nextInt();
        int n2=sc.nextInt();
        //myq.display();
       //myq.dequeue();
       //myq.display();
        while(n2-->0)
       {
        int max=-1;
        int[] tempArray= new int[n1];
        for(int i=0;i<n1;i++)
        {
        	tempArray[i]=myq.dequeue();
        }
        max=tempArray[0];
        for(int i=0;i<n1;i++ )
        	{
            	if(tempArray[i]>max)
            	{
            		max=tempArray[i];
            	}
        	}
       // System.out.println("max"+max);

        //myq.display();
        int dqcount=0;
        for(int i=0;i<n1;i++)
        {
        	if(tempArray[i]!=max)
        		myq.enqueue(tempArray[i]);
        	else if(dqcount==0)
        		{//myq.dequeue();
        		 dqcount++;
        		 continue;
        		}
        	else
        		myq.enqueue(tempArray[i]);
        }

        }
        myq.display();

    }


}