-
Notifications
You must be signed in to change notification settings - Fork 1
/
ReverseSingleLinkedList.java
145 lines (111 loc) · 2.94 KB
/
ReverseSingleLinkedList.java
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
package collection;
import static org.junit.jupiter.api.Assertions.assertTrue;
import org.junit.jupiter.api.Test;
public class ReverseSingleLinkedList<T> {
private Node<T> head;
public ReverseSingleLinkedList() {
}
public String toString() {
StringBuffer toReturn = new StringBuffer("[");
Node<T> tempHead = head;
if (tempHead != null) {
toReturn.append(tempHead.getElement());
while (tempHead.getNext() != null) {
tempHead = tempHead.getNext();
toReturn.append(", ").append(tempHead.getElement());
}
}
toReturn.append("]");
return toReturn.toString();
}
public Node<T> getHead() {
return head;
}
public void setHead(Node<T> head) {
this.head = head;
}
public T add(T data) {
if (data == null) {
return null;
}
Node<T> n = new Node<T>(data, null);
Node<T> tempHead = head;
if (tempHead == null) {
tempHead = n;
head = tempHead;
} else {
while (tempHead.getNext() != null) {
tempHead = tempHead.getNext();
}
tempHead.setNext(n);
}
return data;
}
public T remove(T data) {
Node<T> tempHead = head;
Node<T> previous = head;
if (tempHead == null) {
return null;
} else {
while (tempHead != null) {
if (tempHead.getElement().equals(data)) {
previous.setNext(tempHead.getNext());
break;
}
previous = tempHead;
tempHead = tempHead.next;
}
}
return data;
}
public void reverse() {
Node<T> prev = null;
Node<T> current = head;
Node<T> next = null;
while (current != null) {
next = current.next;
current.next = prev;
prev = current;
current = next;
}
head = prev;
}
@Test
public void test() {
ReverseSingleLinkedList<String> list = new ReverseSingleLinkedList<>();
System.out.println(list);
System.out.println("-----------------------------");
assertTrue("Hello".equalsIgnoreCase(list.add("Hello")));
assertTrue("Saty".equalsIgnoreCase(list.add("Saty")));
assertTrue("vir".equalsIgnoreCase(list.add("vir")));
assertTrue(null == list.add(null));
assertTrue("Man".equalsIgnoreCase(list.add("Man")));
System.out.println(list);
System.out.println("-----------------------------");
assertTrue("vir".equalsIgnoreCase(list.remove(("vir"))));
System.out.println(list);
System.out.println("-----------------------------");
list.reverse();
System.out.println(list);
}
private class Node<T> {
private T element;
private Node<T> next;
public T getElement() {
return element;
}
public void setElement(T element) {
this.element = element;
}
public Node<T> getNext() {
return next;
}
public void setNext(Node<T> next) {
this.next = next;
}
public Node(T element, Node<T> next) {
this.element = element;
this.next = next;
}
}
}