循环链表:
与单链表的最后一个节点的指针域为null不同,循环链表的最后一个节点的指针指向头结点
实现思路:
初始化时将头结点指向自身,添加节点到链表末尾时,将新节点的指针指向头结点
在遍历链表时,判断是否遍历到链表末尾,需要判断当前指针的下一个节点是否为头结点
代码实现:
节点类CircleNode:
public class CircleNode {
public int data;
public CircleNode next;
public CircleNode(int data) {
this.data = data;
}
@Override
public String toString() {
return "CircleNode{" + "data=" + data + '}';
}
}
循环链表类CircleLinkedList:
public class CircleLinkedList {
public CircleNode head = new CircleNode(0);
public CircleLinkedList() {
head.next = head;
}
//添加节点
public void add(CircleNode circleNode) {
CircleNode temp = head;
//找到链表最后一个节点
while (temp.next != head) {
temp = temp.next;
}
temp.next = circleNode;
circleNode.next = head;
}
//删除节点
public void delete(int data) {
CircleNode temp = head;
boolean flag = false; //标志是否找到待删除节点的前一个节点
while (true) {
if (temp.next == head) {
//已经遍历到链表最后了
break;
} else if (temp.next.data == data) {
//找到待删除节点的前一个节点
flag = true;
break;
}
temp = temp.next;
}
if (flag) {
temp.next = temp.next.next;
} else {
System.out.println("要删除的节点不存在");
}
}
//输出链表
public void show() {
//判断链表是否为空
if (head.next == head) {
System.out.println("链表为空");
return;
}
CircleNode temp = head.next;
while (temp != head) {
System.out.println(temp);
temp = temp.next;
}
}
}