数据结构中基本链表结构特点:
(1)链表是以节点的方式来存储,属于链式存储;
(2)每个节点包含data域,next域:指向下一节点;
(3)链表的各个节点不一定是连续存储;
(4)头节点不存储数据,只用于指向下一个节点。
下面的程序是单向链表的基本操作,增删改查,反转,逆序打印。
package yu.practice03.Linkedlist;
import org.w3c.dom.ls.LSOutput;
import java.util.Stack;
public class singlelistDemo {
public static void main(String[] args) {
PersonNode person01 = new PersonNode(1,"张三","三三");
PersonNode person02 = new PersonNode(2,"李四","四四");
PersonNode person03 = new PersonNode(3,"王五","五五");
PersonNode person04 = new PersonNode(4,"陈六","六六");
LinkedList linkedlist = new LinkedList();
linkedlist.add(person01);
linkedlist.add(person02);
linkedlist.add(person03);
linkedlist.add(person04);
System.out.println("将新节点插入到链表末尾的方法:");
linkedlist.show();
System.out.println("linkedlist链表的有效长度:" + LinkedList.getLength(linkedlist.getHead()));
System.out.println("=======================================================");
System.out.println("将新节点按照num的大小有序插入的方法:");
LinkedList list = new LinkedList();
list.addByOrder(person04);
list.addByOrder(person02);
list.addByOrder(person03);
list.addByOrder(person01);
list.show();
System.out.println("linkedlist链表的有效长度:" + LinkedList.getLength(linkedlist.getHead()));
System.out.println("=======================================================");
System.out.println("删除一个节点:")