-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathCircularLinkedList.java
More file actions
99 lines (84 loc) · 1.99 KB
/
Copy pathCircularLinkedList.java
File metadata and controls
99 lines (84 loc) · 1.99 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
package com.fantasy.datastructure.linkedlist;
/**
* 循环链表
*
* <pre>
* author : Fantasy
* version : 1.0, 2020-07-03
* since : 1.0, 2020-07-03
* </pre>
*/
public class CircularLinkedList {
private ListNode head;
private ListNode tail;
public CircularLinkedList() {
head = null;
tail = null;
}
public void insertHead(int value) {
insertHead(new ListNode(value));
}
public void insertHead(ListNode node) {
if (head == null) {
node.next = node;
head = tail = node;
} else {
node.next = head;
tail.next = node;
head = node;
}
}
public void insertTail(int value) {
insertTail(new ListNode(value));
}
public void insertTail(ListNode node) {
if (head == null) {
node.next = node;
head = tail = node;
} else {
node.next = head;
tail.next = node;
tail = node;
}
}
public void deleteHead() {
if (head == null) {
return;
}
if (head == tail) {
head = tail = null;
return;
}
head = head.next;
tail.next = head;
}
public void deleteTail() {
if (tail == null) {
return;
}
if (head == tail) {
head = tail = null;
return;
}
ListNode temp = head;
while (temp.next != tail) {
temp = temp.next;
}
temp.next = head;
tail = temp;
}
public String toString() {
StringBuilder sb = new StringBuilder();
sb.append("[");
for (ListNode node = head; node != null; node = node.next) {
sb.append(node.val);
if (node.next != head) {
sb.append(",").append(" ");
} else {
break;
}
}
sb.append("]");
return sb.toString();
}
}