Java單鏈表的完成代碼。本站提示廣大學習愛好者：（Java單鏈表的完成代碼）文章只能為提供參考，不一定能成為您想要的結果。以下是Java單鏈表的完成代碼正文
上面是小編給年夜家分享的一個應用java寫單鏈表，有成績迎接給我留言哦。
起首界說一個Node類
public class Node {
protected Node next; //指針域
public int data;//數據域
public Node( int data) {
this. data = data;
}
//顯示此節點
public void display() {
System. out.print( data + " ");
}
}
接上去界說一個單鏈表，並完成相干辦法：
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;
}
}
最初我們可以經由過程測試類來做相干測試:
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單鏈表的完成代碼，願望對年夜家有所贊助，假如年夜家有任何疑問請給我留言，小編會實時答復年夜家的。在此也異常感激年夜家對網站的支撐！
