-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathQueueApp.java
More file actions
99 lines (85 loc) · 1.53 KB
/
QueueApp.java
File metadata and controls
99 lines (85 loc) · 1.53 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
class QueueX
{
private long[] mArray;
private int mFront;
private int mRear;
private int mSize;
public QueueX(int size)
{
mArray = new long[size];
mSize = size;
mFront = 0;
mRear = -1;
}
public void status()
{
System.out.print("mFront = "+mFront+" mRear = "+mRear);
System.out.println(" ");
}
public void insert(long value)
{
if(!isFull())
{
mFront++;
if(mFront>=mSize) mFront = 0;
mArray[mFront] = value;
}
else System.out.println("Insert error, queue is full.");
}
public long remove()
{
if(!isEmpty())
{
mRear++;
if(mRear>=mSize)
{
mRear = -1;
return mArray[mSize];
}
else return mArray[mRear];
}
else
{
System.out.println("Remove error, queue is empty");
return -1;
}
}
public long peek()
{
return mArray[mRear];
}
public boolean isFull()
{
if(size()==mSize-1) return true;
else return false;
}
public boolean isEmpty()
{
if(size()==0) return true;
else return false;
}
public int size()
{
if(mFront - mRear >= 1) return (mFront-mRear-1);
else return(mFront-mRear-1+mSize);
}
}
class QueueApp
{
public static void main(String args[])
{
QueueX que = new QueueX(10);
for(int i =0;i<10;i++)
{
long value =(long)(Math.random()*10.0);
que.insert(value);
System.out.println("insert "+value);
que.status();
}
for(int i=0;i<10;i++)
{
System.out.print(que.remove()+" ");
que.status();
}
}
}