java 循环链表（实例）

此循环列表包括基本的增删改查操作

有四个类，Person类  Node类（节点类）循环列表类 测试类

代码和详解如下

Person 类

package com.linklist;


public class Person {
private String name;
private int age;


public String getName() {
return name;
}


public void setName(String name) {
this.name = name;
}


public int getAge() {
return age;
}


public void setAge(int age) {
this.age = age;
}


@Override
public String toString() {
return "Person [toString()=" + this.name + "]" + "年龄" + this.age;
}


public Person() {
super();
}


public Person(String name, int age) {
super();
this.name = name;
this.age = age;
}


}

Node类

package com.linklist;


public class Node {
// 数据,前驱,后继


private Object object;
public Node pre;
public Node next;


public Node() {
}


public Node(Object object, Node pre, Node next) {//指定添加元素的前驱和后继
super();
this.object = object;
this.pre = pre;
this.next = next;
}


public Object getObject() {
return object;
}


public void setObject(Object object) {
this.object = object;
}
}

CircleLinkList循环列表类

package com.linklist;


public class CircleLinkList {
// 链表大小


private int size;
// 链表当前节点


private Node currentNode;


// 链表头节点
private Node head;


public int getSize() {
return size;
}


public CircleLinkList() {
this.size = 0;
}


public void append(Object o) {
// 当链表为空时
Node newNode = new Node(o, null, null);
if (size == 0) {
// 头节点指向新节点
head = newNode;
// 当前节点指向新节点
currentNode = newNode;
// 当前节点指向头节点 --确保是循环链表


} else {
// 添加节点


/*
* 当前节点指向新的节点 新节点的前驱指向 当前节点 当前节点移动到新节点 当前节点的next指向头节点 确保其是 循环链表
*/
currentNode.next = newNode;


newNode.pre = currentNode;


currentNode = newNode;


}
currentNode.next = head;
size++;
}


// 删除节点
public void delete(int pos) {
/*
* after指向头节点用来遍历 before指向after的前一个节点
*/
Node after = head;
Node before = null;
if (pos < size) {


/*
* 查找删除的位置
*/
for (int i = 0; i < pos; i++) {
before = after;
after = before.next;// 
}
/*
* 判断删除位置 1.头节点
* 
* 2.普通节点
*/
if (before == null) {
// 删除头节点
head = after.next;
after.next.pre = after.pre;


} else {
// 删除普通节点--after由for循环遍历到
/*
* before指向after的后继 after后继的前驱指向after的前驱 after被删除
*/

after.next.pre = after.pre;// before
before.next = after.next;


}
size--;
} else {
System.out.println("越界");
}


}


public void insert(Object o, int pos) {
Node after = head;
Node before = null;
/*
* 
* 当插入位置存在时，插入到该位置
*/
if (pos < size) {
for (int i = 0; i < pos; i++) {
before = after;
after = before.next;
}
Node newNode = new Node(o, before, after);//指定其前驱和后继
/*
* 判断 1.插入到头节点 2.插入到普通节点
*/
// 1
if (before == null) {
// 头指针指向新节点


head = newNode;
// 新节点的前驱指向after的前驱
// newNode.pre = after.pre;
} else {
/*
* 创建newNode时其前驱和后继已经指定好 before和 after
*/
// newNode.pre = after.pre;
before.next = newNode;//


}
size++;
} else {
/*
* 当插入位置不存在时，追加到链表尾
*/
append(o);


}
}


// 修改


public void Modify(String name,int age, int pos) {

Node after = head;
Node before = null;
/*
* 
* 当插入位置存在时，插入到该位置
*/
if (pos < size) {
for (int i = 0; i < pos; i++) {
before = after;
after = before.next;
}
if (after.getObject() instanceof Person) {
Person p=(Person)after.getObject();
p.setName(name);
p.setAge(age);
}
}
else
{
System.out.println("该节点不存在");
}


}
public void Modify(Object o, int pos) {

Node after = head;
Node before = null;
Person p;
/*
* 
* 当插入位置存在时，插入到该位置
*/
if (pos < size) {
for (int i = 0; i < pos; i++) {
before = after;
after = before.next;
}
if (after.getObject() instanceof Person && o instanceof Person) {
p=(Person)after.getObject();
Person p1=(Person)o;
p.setName(p1.getName());
p.setAge(p1.getAge());

}
}
else
{
System.out.println("该节点不存在");
}


}


 public String find(Object o,int count)
 {
Node node = head;
for (int i = 0; i < count; i++) {


if (node.getObject() instanceof Person && o instanceof Person) {
Person p = (Person) node.getObject();
Person p1=(Person)o;
if(p.getName().equals(p1.getName())&&p.getAge()==p1.getAge());
{
return "查找到了"+count;
}
}
node = node.next;
}
return "没有查找到";
 }
public void showAll(int count) {
// 遍历循环链表
Node node = head;
for (int i = 0; i < count; i++) {


if (node.getObject() instanceof Person) {
Person p = (Person) node.getObject();
System.out.println(p.toString());
}
node = node.next;
}
}


}

测试类

package com.linklist;


public class Test {


/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
CircleLinkList c = new CircleLinkList();


c.append(new Person("zhang san", 13));


c.append(new Person("li si", 14));


c.insert(new Person("张三", 15), 0);


c.insert(new Person("王五", 16), 1);
System.out.println("*****************");
c.showAll(c.getSize());
System.out.println("*****************");
c.delete(1);


c.insert(new Person("李六", 17), 1);


c.append(new Person("冯五", 18));


c.insert(new Person("周七", 19), 2);
c.insert(new Person("黑八", 15), 0);


c.Modify(new Person("张四",13), 0);

System.out.println(c.find(new Person("黑八",15), c.getSize()));
c.showAll(c.getSize());


System.out.println(c.getSize());
}


}

输出结果

*****************
Person [toString()=张三]年龄15
Person [toString()=王五]年龄16
Person [toString()=zhang san]年龄13
Person [toString()=li si]年龄14
*****************
+++Person [toString()=王五]年龄16
查找到了7
Person [toString()=张四]年龄13
Person [toString()=张三]年龄15
Person [toString()=李六]年龄17
Person [toString()=周七]年龄19
Person [toString()=zhang san]年龄13
Person [toString()=li si]年龄14
Person [toString()=冯五]年龄18
7