FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
JavaArithmetic/src/datastructure/queue_old/QueueTest.java at master · git-jhy/JavaArithmetic · GitHub
git-jhy
JavaArithmetic
Repository navigation
Code
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
JavaArithmetic
/
src
/
datastructure
/
queue_old
/
QueueTest.java
Copy path
More file actions
More file actions
Latest commit
History
History
History
138 lines (103 loc) · 2.93 KB
Breadcrumbs
JavaArithmetic
/
src
/
datastructure
/
queue_old
/
QueueTest.java
Copy path
File metadata and controls
138 lines (103 loc) · 2.93 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
package
datastructure
.
queue_old
;
/**
* Created by ozc on 2018/3/28.
*
* @author ozc
* @version 1.0
*/
public
class
QueueTest
{
public
static
void
main
(
String
[]
args
) {
//初始化队列
Queue
queue
=
new
Queue
();
queue
.
front
=
0
;
queue
.
rear
=
0
;
queue
.
arrays
=
new
int
[
6
];
isEmpty
(
queue
);
//入队
enQueue
(
queue
,
3
);
enQueue
(
queue
,
1
);
enQueue
(
queue
,
2
);
enQueue
(
queue
,
4
);
enQueue
(
queue
,
6
);
//遍历队列
traverseQueue
(
queue
);
//出队
outQueue
(
queue
);
outQueue
(
queue
);
outQueue
(
queue
);
outQueue
(
queue
);
outQueue
(
queue
);
outQueue
(
queue
);
}
/**
* 判断队列是否满了，front和rear指针紧挨着，就是满了
* @param queue
* @return
*/
public
static
boolean
isFull
(
Queue
queue
) {
if
((
queue
.
rear
+
1
) %
queue
.
arrays
.
length
==
queue
.
front
) {
System
.
out
.
println
(
"关注公众号：Java3y--->此时队列满了！"
);
return
true
;
}
else
{
System
.
out
.
println
(
"关注公众号：Java3y--->此时队列没满了！"
);
return
false
;
}
}
/**
* 判断队列是否空，front和rear指针相等，就是空了
* @param queue
* @return
*/
public
static
boolean
isEmpty
(
Queue
queue
) {
if
(
queue
.
rear
==
queue
.
front
) {
System
.
out
.
println
(
"关注公众号：Java3y--->此时队列空的！"
);
return
true
;
}
else
{
System
.
out
.
println
(
"关注公众号：Java3y--->此时队列非空！"
);
return
false
;
}
}
/**
* 入队
*
* @param queue
*/
public
static
void
enQueue
(
Queue
queue
,
int
value
) {
// 不是满的队列才能入队
if
(!
isFull
(
queue
)) {
// 将新的元素插入到队尾中
queue
.
arrays
[
queue
.
rear
] =
value
;
// rear节点移动到新的无效元素位置上
queue
.
rear
= (
queue
.
rear
+
1
) %
queue
.
arrays
.
length
;
}
}
/**
* 遍历队列
* @param queue
*
*/
public
static
void
traverseQueue
(
Queue
queue
) {
// front的位置
int
i
=
queue
.
front
;
while
(
i
!=
queue
.
rear
) {
System
.
out
.
println
(
"关注公众号：Java3y--->"
+
queue
.
arrays
[
i
]);
//移动front
i
= (
i
+
1
) %
queue
.
arrays
.
length
;
}
}
/**
* 出队
*
* @param queue
*/
public
static
void
outQueue
(
Queue
queue
) {
//判断该队列是否为null
if
(!
isEmpty
(
queue
)) {
//不为空才出队
int
value
=
queue
.
arrays
[
queue
.
front
];
System
.
out
.
println
(
"关注公众号：Java3y--->出队的元素是："
+
value
);
// front指针往后面移
queue
.
front
= (
queue
.
front
+
1
) %
queue
.
arrays
.
length
;
}
}
}
Back
|
FazBrowse Home
|
New Git URL