FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
algo/java/09_queue/QueueBasedOnLinkedList.java at master · open-source-backup/algo · GitHub
open-source-backup
/
algo
Public
forked from
wangzheng0822/algo
Notifications
You must be signed in to change notification settings
Fork
0
Star
0
Code
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
algo
/
java
/
09_queue
/
QueueBasedOnLinkedList.java
Copy path
More file actions
More file actions
Latest commit
History
History
History
61 lines (51 loc) · 1.03 KB
Breadcrumbs
algo
/
java
/
09_queue
/
QueueBasedOnLinkedList.java
Copy path
File metadata and controls
61 lines (51 loc) · 1.03 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
package
queue
;
/**
* 基于链表实现的队列
*
* Author: Zheng
*/
public
class
QueueBasedOnLinkedList
{
// 队列的队首和队尾
private
Node
head
=
null
;
private
Node
tail
=
null
;
// 入队
public
void
enqueue
(
String
value
) {
if
(
tail
==
null
) {
Node
newNode
=
new
Node
(
value
,
null
);
head
=
newNode
;
tail
=
newNode
;
}
else
{
tail
.
next
=
new
Node
(
value
,
null
);
tail
=
tail
.
next
;
}
}
// 出队
public
String
dequeue
() {
if
(
head
==
null
)
return
null
;
String
value
=
head
.
data
;
head
=
head
.
next
;
if
(
head
==
null
) {
tail
=
null
;
}
return
value
;
}
public
void
printAll
() {
Node
p
=
head
;
while
(
p
!=
null
) {
System
.
out
.
print
(
p
.
data
+
" "
);
p
=
p
.
next
;
}
System
.
out
.
println
();
}
private
static
class
Node
{
private
String
data
;
private
Node
next
;
public
Node
(
String
data
,
Node
next
) {
this
.
data
=
data
;
this
.
next
=
next
;
}
public
String
getData
() {
return
data
;
}
}
}
Back
|
FazBrowse Home
|
New Git URL