链表——Java语言设计单链表

简介

本篇文章承接上一篇文章C语言设计单链表。C语言设计单链表 在上一篇文章中，通过不增设链表的长度变量length，利用指针的方法来实现在链表指定位置进行增删结点的操作。本文采用Java语言实现单链表。（增设链表长度变量）

简要的分析

具体思想和C语言实现单链表的思路一致，只不过在Java语言中，由“引用”代替了C语言中的"指针"。（值得注意的一点是：在C语言当中，增删节点时需手动分配回收内存）掌握Java的基本语言特性便可读懂下方代码。

具体代码实现

class MyLinkedList {
    
    /** Initialize your data structure here. */
    
    public Node dummyNode;
    public int length;
    
    class Node {
        int val;
        Node next;
        
        Node(){};
    
        Node(int val) {
            this.val = val;
            this.next = null;
        }
    }
    
    
    public MyLinkedList() {
        dummyNode = new Node();
        length = 0;
    }
    
    /** Get the value of the index-th node in the linked list. 
    If the index is invalid, return -1. */
    public int get(int index) {
        if(index<0||index>length-1)
            return -1;
        Node current = dummyNode.next;
        for(int i = 0;i<index;i++){
            current = current.next;
        }
        return current.val;
    }
    
    /** Add a node of value val before the first element of 
    the linked list. After the insertion, the new node will 
    be the first node of the linked list. */
    public void addAtHead(int val) {
        Node current = dummyNode;
        Node newNode = new Node(val);
        newNode.next = dummyNode.next;
        dummyNode.next = newNode;
        length++;
    }
    
    /** Append a node of value val to the last element of 
    the linked list. */
    public void addAtTail(int val) {
        Node current = dummyNode;
        Node newNode = new Node(val);
        for(int i = 0;i<length;i++){
            current = current.next;
        }
        current.next = newNode;
        length++;
    }
    
    /** Add a node of value val before the index-th node in 
    the linked list. If index equals to the length of linked 
    list, the node will be appended to the end of linked list. 
    If index is greater than the length, the node will not be inserted. */
    public void addAtIndex(int index, int val) {
        if(index<=length){
            if(index<=0)
                addAtHead(val);
            else {
                Node current = dummyNode;
                Node newNode = new Node(val);
                for(int i = 0;i<index;i++){
                    current = current.next;
                }
                newNode.next = current.next;
                current.next = newNode;
                length++;
            }
        }
            
        
    }
    
    /** Delete the index-th node in the linked list, 
    if the index is valid. */
    public void deleteAtIndex(int index) {
        if(index>=0&&index<length){
            Node current = dummyNode;
            for(int i = 0;i<index;i++ ){
                current = current.next;
            }
            current.next = current.next.next;
            length--;
        }
    }
}

/**
 * Your MyLinkedList object will be instantiated and called as such:
 * MyLinkedList obj = new MyLinkedList();
 * int param_1 = obj.get(index);
 * obj.addAtHead(val);
 * obj.addAtTail(val);
 * obj.addAtIndex(index,val);
 * obj.deleteAtIndex(index);
 */