链表

链表基础

单向链表

　　单向链表包括两部分，第一部分是节点中包含的内容，第二部分是这个节点的下一个节点的地址值。

　　模拟一个单链表

 

/**
 * 单向链表的节点
 */
public class SingleNode {
    private User user;
    private SingleNode next;

    public SingleNode(User user, SingleNode next) {
        this.user = user;
        this.next = next;
    }

    public SingleNode() {
    }

    public User getUser() {
        return user;
    }

    public void setUser(User user) {
        this.user = user;
    }

    public SingleNode getNext() {
        return next;
    }

    public void setNext(SingleNode next) {
        this.next = next;
    }

/**
 * 节点中的数据
 */
public class User {
    private int index;//人物排名
    private String name;//人物姓名
    private String sex;//人物性别
    private int age;//人物年龄

    public int getIndex() {
        return index;
    }

    public void setIndex(int index) {
        this.index = index;
    }

    public String getName() {
        return name;
    }

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

    public String getSex() {
        return sex;
    }

    public void setSex(String sex) {
        this.sex = sex;
    }

    public int getAge() {
        return age;
    }

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

    public User(int index, String name, String sex, int age) {
        this.index = index;
        this.name = name;
        this.sex = sex;
        this.age = age;
    }

    public User() {
    }

/**
 * 单链表的方法
 */
public class SingleLinkedList {
    private SingleNode head = new SingleNode(null, null);//单链表的头结点

    //添加数据到链表尾端
    public void addIntoLinkedList(User user) {
        SingleNode next = new SingleNode(user, null);
        SingleNode temp = this.head;
        while (temp.getNext() != null) {
            temp = temp.getNext();
        }
        //表示到了链表的尾端
        temp.setNext(next);
    }

    //按照人物排名大小添加至链表(由小至大)
    public void addByIndex(User user) {
        int index = user.getIndex();//需要添加的人物排名
        SingleNode next = new SingleNode(user, null);
        SingleNode temp = this.head;
        temp.setUser(new User(-1, null, null, 0));//设置初始排名为-1
        while (true) {
            //到达链表的尾端
            if (temp.getNext() == null) {
                temp.setNext(next);
                break;
            }
            if (temp.getNext().getUser().getIndex() >= index) {
                next.setNext(temp.getNext());
                temp.setNext(next);
                break;
            }
            temp = temp.getNext();
        }
    }

    //遍历链表
    public void showLinkedList() {
        int index=1;
        SingleNode temp = this.head.getNext();
        while (true){
            if (temp==null){
                System.out.printf("遍历完成,一共有%d个用户",index);
                break;
            }
            System.out.printf("第%d位人物"+temp.getUser().getName(),temp.getUser().getIndex());
            temp=temp.getNext();
            System.out.println();
            index++;
        }
    }

/**
 * 测试单链表
 */
public class TestSingleLinkedList {
    public static void main(String[] args) {
        //按顺序的链表
        SingleLinkedList indexLinkedList=new SingleLinkedList();
        //不安循序的链表
        SingleLinkedList noIndexLinkedList=new SingleLinkedList();

        Random r=new Random();
        //循环创建随机用户
        for (int i = 0; i < 10; i++) {
            int index =r.nextInt(10);
            User user=new User(index,"第"+i+"个用户","男",i);
            indexLinkedList.addByIndex(user);
            noIndexLinkedList.addIntoLinkedList(user);

        }
        System.out.println("有序的链表开始遍历....");
        indexLinkedList.showLinkedList();
        System.out.println("无序的链表开始遍历....");
        noIndexLinkedList.showLinkedList();
    }

至此完成了单链表的简单理解和手动实现。