java实现纯粹的插入和删除操做

java实现纯粹的插入和删除操做

package com.atguigu.priciple.algorithm;

public class linked {
    //头节点指针
    private Node head;
    //尾节点指针
    private Node last;
    //链表实际长度
    private int size;

    /**
     * 链表插入元素
     * @param data 插入元素
     * @param index 插入位置
     */

    public void insert(int data, int index) throws Exception{
        if (index<0 || index>size){
            throw new IndexOutOfBoundsException("超出链表节点范围！");
        }
        Node insertedNode = new Node(data);
        if (size == 0){
            //空链表
            head = insertedNode;
            last = insertedNode;
        }else if (index == 0){
            //插入头部
            insertedNode.next = head;
            head = insertedNode;
        }else if (size == index){
            //插入尾部
            last.next = insertedNode;
            last = insertedNode;
        }else {
            //插入中间
            Node prevNode = get(index-1);
            insertedNode.next = prevNode.next;
            prevNode.next = insertedNode;
        }
        size++;
    }
    /**
     * 链表删除元素
     * @param index 删除的位置
     */
    public  Node remove(int index) throws Exception{
        if (index<0 || index>=size){
            throw new IndexOutOfBoundsException("超出链表节点的范围！");
        }
        Node removeNode = null;
        if (index == 0){
            //删除头节点
            removeNode = head;
            head = head.next;
        }else if (index == size-1){
            //删除尾节点
            Node prevNode = get(index-1);
            removeNode = prevNode.next;
            prevNode.next = null;
            last = prevNode;
        }else {
            //删除中间节点
            Node prevNode = get(index-1);
            Node nextNode = prevNode.next.next;
            removeNode = prevNode.next;
            prevNode.next = nextNode;
        }
        size--;
        return  removeNode;
    }
    /**
     * 链表查找元素
     * @param index 查找的位置
     */
    public Node get(int index) throws Exception{
        if (index<0 || index>=size){
            throw new IndexOutOfBoundsException("超出链表节点范围！");
        }
        Node temp = head;
        for (int i=0; i<index;i++){
            temp = temp.next;
        }
        return temp;
    }
    /**
     * 输出链表
     */
    public void output(){
        Node temp = head;
        while (temp!=null){
            System.out.println(temp.data);
            temp = temp.next;
        }
    }
    /**
     * 链表节点
     */
    private static class Node{
        int data;
        Node next;
        Node(int data){
            this.data = data;
        }
    }

    public static void main(String[] args) throws Exception{
        linked linked = new linked();
        linked.insert(3,0);
        linked.insert(7,1);
        linked.insert(9,2);
        linked.insert(5,3);
        linked.insert(6,1);
        linked.remove(0);
        linked.output();
    }
}