Java单链表的增删改查与面试题详解

public class Node {
    public int data;
    public String name;
    public Node next;
    public Node(int data, String name){
        this.data = data;
        this.name = name;
    }
    @Override
    public String toString() {
        return "Node{" +
                "data=" + data +
                ", name='" + name + '\'' +
                '}';
    }
}

private Node head = new Node(0,"");

public class SingleLinkedList {
    //首先创建头结点，此结点表示链表的头，无具体数据
    private Node head = new Node(0,"");
    //添加结点操作
    public void addData(Node node){
        Node temp = head;
        while (true){
            if (temp.next == null){
                temp.next = node;
                node.next = null;
                break;
            }
            temp = temp.next;
        }
    }
}

     public void delData(Node node){
        Node temp = head;
        while (true){
            //如果是要删除的结点
            if (temp.next.data == node.data){
                temp.next = temp.next.next;
                break;
            }else if(temp.next == null){
                System.out.println("未找到结点！");
                break;
            }
            temp = temp.next;
        }
    }

    public int countData(){
        Node temp = head.next;
        int count = 0;
        while (true){
            if (temp == null){
                break;
            }
            count++;
            temp = temp.next;
        }
        return count;
    }

    public Node referNode(int n){
        //根据前面计算有效个数的方法，求得链表总结点个数
        int max = countData();
        //计数
        int count = 1;
        //判断指定的结点是否在范围内
        if (!(n >= 1 && n <= max)){
            throw new RuntimeException("没有此结点!");
        }
        //辅助结点
        Node temp = head.next;
        //循环遍历查找
        while (true){
            //满足条件，则是我们要找的结点
            if (count == (max - n + 1)){
                return temp;
            }else {
                temp = temp.next;
                count++;
            }
        }
    }

public void nodeReversal(Node head){
        //如果链表为空或链表只有一个结点，则不需要反转
        if (head.next == null || head.next.next == null){
            return;
        }
        //辅助变量temp
        Node temp = head.next;
        //辅助变量temp1
        Node temp1 = null;
        //循环遍历
        while (true){
            //退出循环的条件
            if (temp == null){
                break;
            }
            //首先将temp的下一个结点给temp1
            temp1 = temp.next;
            //然后将temp的next指向新链表头headReversal的next（头指向的下一个）
            temp.next = headReversal.next;
            //再然后将新链表头headReversal的next指向temp结点
            headReversal.next = temp;
            //最后将temp1记录的结点赋值给temp
            temp = temp1;
        }
        //遍历结束，将新的顺序替换原来的顺序
        head.next = headReversal.next;
        //显示链表，这个方法需要自己写
        showList(head);
}