-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMyLinkList.java
More file actions
171 lines (151 loc) · 3.67 KB
/
Copy pathMyLinkList.java
File metadata and controls
171 lines (151 loc) · 3.67 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
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
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
package linklist;
public class MyLinkList<E> {
/*
addFirst(LNode node)
addLast(LNode node)
insertAfter(LNode node)
insertBefore(LNode node)
findByIndex(int index)
deleteFirst()
deleteLast()
deleteIndex(int index)
deleteNode(LNode node)
*/
private static class LNode<E> {
E data;
LNode<E> next;
LNode(E data, LNode<E> node) {
this.data = data;
this.next = next;
}
}
int count = 0;
LNode<E> head;
public int count() {
return count;
}
public void printList() {
if (head == null) {
return;
}
LNode<E> current = head;
while (current != null) {
System.out.print(current.data + " ");
current = current.next;
}
System.out.println();
}
public void addFirst(E data) {
LNode<E> newNode = new LNode<>(data, null);
if (head == null) {
head = newNode;
} else {
newNode.next = head;
head = newNode;
}
count++;
}
public void addLast(E data) {
LNode<E> newNode = new LNode<>(data, null);
if (head == null) {
head = newNode;
} else {
LNode tempNode = head;
while (tempNode.next != null) {
tempNode = tempNode.next;
}
tempNode.next = newNode;
}
count++;
}
public void insertAfter(LNode node) {
if (node == null) {
return;
}
if (head == node) {
node.next = head.next;
head.next = node;
} else {
LNode tempNode = head;
while (tempNode != node && tempNode != null) {
tempNode = tempNode.next;
}
if (tempNode == null) {
return;
}
node.next = tempNode.next;
tempNode.next = node;
}
}
public void insertBefore(LNode node) {
if (node == null) {
return;
}
if (head == node) {
node.next = head;
head.next = node;
} else {
LNode tempNode = head;
while (tempNode.next != node && tempNode != null) {
tempNode = tempNode.next;
}
if (tempNode == null) {
return;
}
node.next = tempNode.next;
tempNode.next = node;
}
}
public E findByIndex(int index) {
if (index < 0) {
return null;
}
LNode<E> node = head;
for (int i = 1; i <= index; i++) {
node = node.next;
}
if (node == null) {
return null;
}
return node.data;
}
public void deleteFirst() {
if (head == null) {
return;
}
head = head.next;
}
public void deleteLast() {
if (head == null) {
return;
}
if (head.next == null) {
head = null;
return;
}
LNode tempNode = head;
while (tempNode.next.next != null) {
tempNode = tempNode.next;
}
tempNode.next = null;
}
/**
* 查找中间节点
*/
public E findMidNode() {
if (head == null) {
return null;
}
LNode<E> tempNode = head;
LNode<E> tempMidNode = head;
int i = 0;
while (tempNode.next != null) {
tempNode = tempNode.next;
if (i % 2 > 0) {
tempMidNode = tempMidNode.next;
}
i++;
}
return tempMidNode.data;
}
}