-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMyCircularQueue.java
More file actions
168 lines (158 loc) · 4.32 KB
/
Copy pathMyCircularQueue.java
File metadata and controls
168 lines (158 loc) · 4.32 KB
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
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
import java.util.ArrayList;
import java.util.List;
public class MyCircularQueue {
/** Initialize your data structure here. Set the size of the queue to be k. */
private Integer[] data;
private Integer front;
private Integer rear;
public MyCircularQueue(int k) {
data = new Integer[k];
front = rear = null;
}
/** Insert an element into the circular queue. Return true if the operation is successful. */
public boolean enQueue(int value) {
if(this.isFull())
{
return false;
}else{
if(rear==null){
front = rear =0;
data[rear] = value;
return true;
}
rear = (++rear) % data.length;
data[rear] = value;
return true;
}
}
/** Delete an element from the circular queue. Return true if the operation is successful. */
public boolean deQueue() {
if(this.isEmpty())
{
return false;
}else{
if(front == rear)
{
front = rear = null;
}else{
front = ++front % data.length;
}
return true;
}
}
/** Get the front item from the queue. */
public int Front() {
if(front == null)
return -1;
return data[front];
}
/** Get the last item from the queue. */
public int Rear() {
if(rear == null)
return -1;
return data[rear];
}
/** Checks whether the circular queue is empty or not. */
public boolean isEmpty() {
if(front == rear&&front==null)
return true;
return false;
}
/** Checks whether the circular queue is full or not. */
public boolean isFull() {
if(rear!=null && front!=null&&(rear+1)%data.length == front)
return true;
return false;
}
/**
* Your MyCircularQueue object will be instantiated and called as such:
* MyCircularQueue obj = new MyCircularQueue(k);
* boolean param_1 = obj.enQueue(value);
* boolean param_2 = obj.deQueue();
* int param_3 = obj.Front();
* int param_4 = obj.Rear();
* boolean param_5 = obj.isEmpty();
* boolean param_6 = obj.isFull();
*/
}
///*
//class MyCircularQueue {
//
// private int[] data;
// private int head;
// private int tail;
// private int size;
//
// /** Initialize your data structure here. Set the size of the queue to be k. */
//public MyCircularQueue(int k) {
// data = new int[k];
// head = -1;
// tail = -1;
// size = k;
//}
//
// /** Insert an element into the circular queue. Return true if the operation is successful. */
// public boolean enQueue(int value) {
// if (isFull() == true) {
// return false;
// }
// if (isEmpty() == true) {
// head = 0;
// }
// tail = (tail + 1) % size;
// data[tail] = value;
// return true;
// }
//
// /** Delete an element from the circular queue. Return true if the operation is successful. */
// public boolean deQueue() {
// if (isEmpty() == true) {
// return false;
// }
// if (head == tail) {
// head = -1;
// tail = -1;
// return true;
// }
// head = (head + 1) % size;
// return true;
// }
//
// /** Get the front item from the queue. */
// public int Front() {
// if (isEmpty() == true) {
// return -1;
// }
// return data[head];
// }
//
// /** Get the last item from the queue. */
// public int Rear() {
// if (isEmpty() == true) {
// return -1;
// }
// return data[tail];
// }
//
// /** Checks whether the circular queue is empty or not. */
// public boolean isEmpty() {
// return head == -1;
// }
//
// /** Checks whether the circular queue is full or not. */
// public boolean isFull() {
// return ((tail + 1) % size) == head;
// }
//}
//
///**
// * Your MyCircularQueue object will be instantiated and called as such:
// * MyCircularQueue obj = new MyCircularQueue(k);
// * boolean param_1 = obj.enQueue(value);
// * boolean param_2 = obj.deQueue();
// * int param_3 = obj.Front();
// * int param_4 = obj.Rear();
// * boolean param_5 = obj.isEmpty();
// * boolean param_6 = obj.isFull();
// */
// */