javaTestStruct/LinkListTest.java at master · zengruios/javaTestStruct · GitHub

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
packagecom.zengrui.java.struct;

/**
 * @Description: 链表测试
 * @Author: zengrui
 * @CreateTime: 2019/10/28 10:11
 */
publicclassLinkListTest {
ListNodehead;
ListNodetail;
LinkListTest() {}
staticclassListNode<T> {
Tdata;
ListNodeprev;
ListNodenext;
ListNode() {}
ListNode(Tvalue) {
this.data = value;
 }
 }

// 单向链表尾部插入
public <T> LinkListTestinsertList(Tvalue) {
ListNode<T> newNode = newListNode<>(value);
if (this.head == null && this.tail == null) {
this.head = this.tail = newNode;
 } else {
this.tail.next = newNode;
this.tail = newNode;
 }
returnthis;
 }
// 双向链表尾部插入
public <T> LinkListTestinsertDoubleList(Tvalue) {
ListNode<T> newNode = newListNode<>(value);
if (this.head == null && this.tail == null) {
// 空链表
this.head = newNode;
this.tail = newNode;
 } else {
this.tail.next = newNode;
newNode.prev = this.tail;
this.tail = newNode;
 }
returnthis;
 }

publicstaticvoidmain(finalString[] args) throwsException {
// 单向链表
LinkListTestlistTest = newLinkListTest();
listTest.insertList(97).insertList(96).insertList(95);
System.out.println("head: " + listTest.head + ", tail: " + listTest.tail);
// 循环链表
listTest.tail.next = listTest.head;
// 双向链表
LinkListTestdoubleListTest = newLinkListTest();
doubleListTest.insertDoubleList(100).insertDoubleList(99).insertDoubleList(98);

// 回文串
byte[] strArray = newbyte[] {'a', 'b', 'c', 'd', 'd', 'e', 'f', 'g'};
// byte[] strArray = new byte[] {'a', 'b', 'c', 'd', 'd', 'c', 'b', 'a'};
// byte[] strArray = new byte[] {'a', 'b', 'c', 'd', 'c', 'b', 'a'};
LinkListTestlistTestPalindrome = newLinkListTest();
for (inti = 0; i < strArray.length; ++i) {
listTestPalindrome.insertList(newString(strArray, i, 1));
 }

ListNode<String> slow = listTestPalindrome.head;
ListNode<String> fast = listTestPalindrome.head;
ListNode<String> prev = null;
while (fast != null && fast.next != null) {
fast = fast.next.next;
ListNode<String> next = slow.next;
slow.next = prev;
prev = slow;
slow = next;
 }
if (fast != null) {
slow = slow.next;
 }

while (slow != null) {
if (!slow.data.equals(prev.data)) {
System.out.println("No Palindrome");
return;
 }
slow = slow.next;
prev = prev.next;
 }
System.out.println("Palindrome");

System.out.println("Finished");
 }
}