Java單鏈表的實(shí)現(xiàn)代碼

更新時(shí)間：2016年07月05日 11:11:48 作者：_popc

這篇文章主要介紹了Java單鏈表的實(shí)現(xiàn)代碼的相關(guān)資料,非常不錯(cuò)，具有參考借鑒價(jià)值，需要的朋友可以參考下

下面是小編給大家分享的一個(gè)使用java寫單鏈表，有問(wèn)題歡迎給我留言哦。

首先定義一個(gè)Node類

public class Node {
protected Node next; //指針域 
public int data;//數(shù)據(jù)域 

public Node( int data) { 
this. data = data; 
} 
//顯示此節(jié)點(diǎn) 
public void display() { 
System. out.print( data + " "); 
} 
}

接下來(lái)定義一個(gè)單鏈表，并實(shí)現(xiàn)相關(guān)方法：

public class LinkList {
public Node first; // 定義一個(gè)頭結(jié)點(diǎn)
private int pos = 0;// 節(jié)點(diǎn)的位置
public LinkList() {
this.first = null;
}
// 插入一個(gè)頭節(jié)點(diǎn)
public void addFirstNode(int data) {
Node node = new Node(data);
node.next = first;
first = node;
}
// 刪除一個(gè)頭結(jié)點(diǎn),并返回頭結(jié)點(diǎn)
public Node deleteFirstNode() {
Node tempNode = first;
first = tempNode.next;
return tempNode;
}
// 在任意位置插入節(jié)點(diǎn) 在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;
}
// 刪除任意位置的節(jié)點(diǎn)
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;
}
// 根據(jù)節(jié)點(diǎn)的data刪除節(jié)點(diǎn)(僅僅刪除第一個(gè))
public Node deleteByData(int data) {
Node current = first;
Node previous = first; // 記住上一個(gè)節(jié)點(diǎn)
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;
}
// 顯示出所有的節(jié)點(diǎn)信息
public void displayAllNodes() {
Node current = first;
while (current != null) {
current.display();
current = current.next;
}
System.out.println();
}
// 根據(jù)位置查找節(jié)點(diǎn)信息
public Node findByPos(int index) {
Node current = first;
if (pos != index) {
current = current.next;
pos++;
}
return current;
}
// 根據(jù)數(shù)據(jù)查找節(jié)點(diǎn)信息
public Node findByData(int data) {
Node current = first;
while (current.data != data) {
if (current.next == null)
return null;
current = current.next;
}
return current;
}
}

最后我們可以通過(guò)測(cè)試類來(lái)做相關(guān)測(cè)試:

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 
//調(diào)用此方法會(huì)print 19,22,23,99,21,20 
linkList.displayAllNodes(); 
}
}

至此，對(duì)單鏈表的操作就筆記到這里了。

以上所述是小編給大家介紹的Java單鏈表的實(shí)現(xiàn)代碼，希望對(duì)大家有所幫助，如果大家有任何疑問(wèn)請(qǐng)給我留言，小編會(huì)及時(shí)回復(fù)大家的。在此也非常感謝大家對(duì)腳本之家網(wǎng)站的支持！

您可能感興趣的文章: