Java 创建并实现单链表类以及实验测试

骑猪看日落 2022-03-27 06:52 166阅读 0赞

要求:请完成单链表的创建、查找、插入，并做相应的测试。建议采用接口的方式完成单链表的创建以及单链表所具有的创建、遍历、插入、删除等操作。测试实验的节点类型为简单学生类。简单学生类的属性包括学号、姓名、专业等基本信息以及类的常用操作（得到和修改属性），简单的显示。、
    package list;
    class Student{
        public int id;//学号
        public String name;//姓名
        public String major;//专业
        public Student(int id,String name,String major)
        {
            this.id = id;
            this.name=name;
            this.major=major;
        }
    }
    class Node {//创建节点
        public Node next; //指针域
        public Student data;//数据域
    
        public Node(Student data) {
            this. data = data;
        }
        public Student getData(){
            return data;
        }
        public Node getNext(){
            return next;
        }
    
        public void setData(Student data) {
            this.data = data;
        }
    
        public void setNext(Node next) {
            this.next = next;
        }
    }
    interface Llist{
        boolean isEmpty();//判断是否为空
        int length();//求长度
        void add(Student data);// 插入一个头节点
        void insert(int index,Student data);// 在任意位置插入节点
        Node removeFirst();// 删除一个头结点,并返回头结点
        Node remove(int index);// 删除任意位置的节点
        void change(int index,Student data);//修改信息
        Node get( int index);// 根据位置查找节点信息
        void printLink();//打印
    }
    class LinkList implements Llist{
        public Node head; // 定义一个头结点
        private int pos = 0;// 节点的位置
    
        public LinkList() {
            this. head = null;
        }
        public boolean isEmpty() {//判断是否为空
            return head.next == null;
        }
        public int length(){//求长度
            int length=0;
            Node p=head.next;
            while(p!=null){
                p=p.next;
                length++;
            }
            return length;
        }
        public void add(Student data) {// 插入一个头节点
            Node node = new Node(data);
            node. next = head;
            head = node;
        }
    
        public void insert(int index, Student data) {// 在任意位置插入节点 在index的后面插入
            Node node = new Node(data);
            Node current = head;
            Node previous = head;
            while ( pos != index) {
                previous = current;
                current = current. next;
                pos++;
            }
            node. next = current;
            previous. next = node;
            pos = 0;
        }
        public Node removeFirst() {// 删除一个头结点,并返回头结点
            Node node = head;
            head = node. next;
            return node;
        }
        public Node remove( int index) { // 删除任意位置的节点
            Node current = head;
            Node previous = head;
            while ( pos != index) {
                pos++;
                previous = current;
                current = current. next;
            }
            if(current == head) {
                head = head. next;
            } else {
                pos = 0;
                previous. next = current. next;
            }
            return current;
        }
        public void change(int index,Student data) {//修改信息
            index--;
            Node current = head;
            while (index != -1) {
                current = current.getNext();
                index--;
            }
            current.setData(data);
        }
        public Node get( int index) {// 根据位置查找节点信息
            Node current = head;
            if ( pos != index) {
                current = current. next;
                pos++;
            }
            return current;
        }
        public void printLink() {//打印
            Node p = head;
            while (p != null) {
                System.out.println("学号："+p.data.id+"  "+"姓名："+p.data.name+"  "+"专业："+p.data.major);
                p=p.next;
            }
        }
    }
    public class List {
        public static void main(String[] args){
            LinkList L=new LinkList();/*创建一个空的链表*/
            L.add(new Student(1,"小一","物联网"));
            L.insert(1,new Student(2,"小二","物联网"));
            L.insert(2,new Student(3,"小三","物联网"));
            L.insert(3,new Student(4,"小四","物联网"));
            L.printLink();
    
            System.out.println("删除第2个位置信息");
            L.remove(2);
            L.printLink();
    
            System.out.println("修改第1个位置信息");
            L.change(1,new Student(5,"小五","物联网"));
            L.printLink();
    
            System.out.println("查找第1个位置信息");
            System.out.println("学号："+L.get(1).data.id+"  "+"姓名："+L.get(1).data.name+"  "+"专业："+L.get(1).data.major);
        }
    }