下面是小編給大家分享的一個使用java寫單鏈表，有問題歡迎給我留言哦。
首先定義一個Node類
|
1
2
3
4
5
6
7
8
9
10
11
12
|
public class Node {protected Node next; //指針域 public int data;//數據域 public Node( int data) { this. data = data; } //顯示此節點 public void display() { System. out.print( data + " "); } } |
接下來定義一個單鏈表，并實現相關方法：
|
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
|
public class LinkList {public Node first; // 定義一個頭結點private int pos = 0;// 節點的位置public LinkList() {this.first = null;}// 插入一個頭節點public void addFirstNode(int data) {Node node = new Node(data);node.next = first;first = node;}// 刪除一個頭結點,并返回頭結點public Node deleteFirstNode() {Node tempNode = first;first = tempNode.next;return tempNode;}// 在任意位置插入節點 在index的后面插入public void add(int index, int data) {Node node = new Node(data);Node current = first;Node previous = first;while (pos != index) {previous = current;current = current.next;pos++;}node.next = current;previous.next = node;pos = 0;}// 刪除任意位置的節點public Node deleteByPos(int index) {Node current = first;Node previous = first;while (pos != index) {pos++;previous = current;current = current.next;}if (current == first) {first = first.next;} else {pos = 0;previous.next = current.next;}return current;}// 根據節點的data刪除節點(僅僅刪除第一個)public Node deleteByData(int data) {Node current = first;Node previous = first; // 記住上一個節點while (current.data != data) {if (current.next == null) {return null;}previous = current;current = current.next;}if (current == first) {first = first.next;} else {previous.next = current.next;}return current;}// 顯示出所有的節點信息public void displayAllNodes() {Node current = first;while (current != null) {current.display();current = current.next;}System.out.println();}// 根據位置查找節點信息public Node findByPos(int index) {Node current = first;if (pos != index) {current = current.next;pos++;}return current;}// 根據數據查找節點信息public Node findByData(int data) {Node current = first;while (current.data != data) {if (current.next == null)return null;current = current.next;}return current;}} |
最后我們可以通過測試類來做相關測試:
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
|
public class TestLinkList {public static void main(String[] args) { LinkList linkList = new LinkList(); linkList.addFirstNode(20); linkList.addFirstNode(21); linkList.addFirstNode(19); //print19,21,20 linkList.add(1, 22); //print19,22,21,20 linkList.add(2, 23); //print19,22,23,21,20 linkList.add(3, 99); //print19,22,23,99,21,20 //調用此方法會print 19,22,23,99,21,20 linkList.displayAllNodes(); }} |
至此，對單鏈表的操作就筆記到這里了。
以上所述是小編給大家介紹的Java單鏈表的實現代碼，希望對大家有所幫助，如果大家有任何疑問請給我留言，小編會及時回復大家的。在此也非常感謝大家對服務器之家網站的支持！
原文鏈接：http://www.cnblogs.com/_popc/p/4025684.html
