这篇文章主要讲解了“Java单链表如何实现”,文中的讲解内容简单清晰,易于学习与理解,下面请大家跟着小编的思路慢慢深入,一起来研究和学习“Java单链表如何实现”吧!
public class Linked {
private Node head;
public void addNode(Node node) {
if (null == head) {
head = node;
return;
}
Node temp = head;
while (null != temp.getNext()) {
temp = temp.getNext();
}
temp.setNext(node);
}
public void delNode(Node node) {
if (head.equals(node)) {
head = head.getNext();
return;
}
Node temp = head;
Node prev = temp;
Node cur = temp.next;
while (null != temp.next) {
if (node.equals(temp.next)) {
if (null != cur.next) {
prev.next = cur.next;
} else {
prev.next = null;
}
break;
}
temp = prev.next;
prev = cur;
cur = cur.next;
}
}
public void updateNode(Node source, Node target) {
if (source.equals(head)) {
head = target;
}
Node temp = head;
while (null != temp.next) {
Node cur = temp.next;
if (cur.equals(source)) {
temp.next = target;
}
temp = temp.next;
}
}
public Node find(int index) {
if (0 == index) {
return head;
}
Node temp = head;
int curIndex = 1;
while (null != temp.next) {
if (index == curIndex) {
return temp.next;
}
temp = temp.next;
}
return null;
}
public static void main(String[] args) {
Linked linked = new Linked();
Node node = new Node();
node.setData("1");
Node node2 = new Node();
node2.setData("2");
Node node3 = new Node();
node3.setData("3");
linked.addNode(node);
linked.addNode(node2);
linked.addNode(node3);
// Node updateNode = node2;
// updateNode.setData("update");
// linked.updateNode(node2, updateNode);
Node nodeFind=linked.find(1);
System.out.println(nodeFind);
}
}
感谢各位的阅读,以上就是“Java单链表如何实现”的内容了,经过本文的学习后,相信大家对Java单链表如何实现这一问题有了更深刻的体会,具体使用情况还需要大家实践验证。这里是亿速云,小编将为大家推送更多相关知识点的文章,欢迎关注!
原创文章,作者:506227337,如若转载,请注明出处:https://blog.ytso.com/227748.html