一、概述
- 循环链表与单向链表相似,唯一的区别是,在创建循环链表的时候,让其头结点的next指向本身
- 换句话说,让链表的尾结点指向头结点
- 如果想要从后往前遍历链表,又不想付出代价去创建双向链表,则可以创建一个循环链表 ,从尾结点向后移动,就等于从后往前遍历链表
二、代码展示
有疑问可以看看单链表那篇,详细
- 在单链表对象封装的基础上,把判断最后一个元素时判断Null改完head
function Node(ele){
this.element = ele;
this.next = null;
}
function LinkedList(){
this.head = new Node("head");
this.head.next = this.head;
this.find = find; //遍历链表,查找给定的元素
this.insert = insert; //插入节点
this.remove = remove; //删除节点
this.display = display; //遍历展示
this.findPre = findPre; //查找指定元素的前驱
}
function find(item){
var obj = this.head;
while(obj.element != item && obj != this.head){
obj = obj.next;
}
return obj;
}
function insert(cur,item){
var item = new Node(item);
var cur = this.find(cur);
if(cur){
item.next = cur.next;
cur.next = item;
}
}
function findPre(item){
var obj = this.head;
while(obj.next.element != item && obj.next != this.head){
obj = obj.next;
}
return obj;
}
function remove(item){
var item = this.findPre(item);
if(item.next.next != this.head){
item.next = item.next.next;
}
}
function display(){
var obj = this.head.next;
while(obj != this.head){
console.log(obj.element);
obj=obj.next;
}
}
var list = new LinkedList();
list.insert("head","monkey");
list.insert("monkey","cat");
list.insert("cat","mall");
list.display();
list.remove("cat");
list.display()