forked from fantj2016/Java-dataStruct
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMyQueue.java
More file actions
67 lines (66 loc) · 1.26 KB
/
MyQueue.java
File metadata and controls
67 lines (66 loc) · 1.26 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
package com.fantj.dataStruct.queue;
/**
* 队列（先进先出）
* Created by Fant.J.
* 2017/12/21 10:44
*/
public class MyQueue {
//底层使用数组
private long []arr;
//有效数据的多少
private int elements;
//队头
private int front;
//队尾
private int end;
/**
* 默认构造方法
*/
public MyQueue(){
arr = new long[10];
elements = 0;
front = 0;
end = -1;
}
/**
* 带参数的构造方法，参数为数组大小
*/
public MyQueue(int maxsize){
arr = new long[maxsize];
elements = 0;
front = 0;
end = -1;
}
/**
* 添加数据，从队尾插入
*/
public void insert(long value){
arr[++end] = value;
elements++;
}
/**
* 删除数据，从队尾删除
*/
public long remove(){
elements--;
return arr[front++];
}
/**
* 查看数据，从对头查看
*/
public long peek(){
return arr[front];
}
/**
* 判断是否为空
*/
public boolean isEmpty(){
return elements == 0;
}
/**
* 判断是否满了
*/
public boolean isFull(){
return elements == arr.length;
}
}