【数据结构】Java 版本 链表常用操作

package start;

import java.awt.List;
import java.util.LinkedList;

public class Linkedlist {

    public static void main(String[] args) {
        // Create a LinkedList
        LinkedList<Integer> list = new LinkedList<Integer>();

        // Add element
        // Time Complexity: O(1)
        list.add(1);
        list.add(2);
        list.add(3);
        // [1,2,3]
        System.out.println(list.toString());

        // Insert element
        // Time Complexity: O(N)
        list.add(2, 99);
        // [1,2,99,3]
        System.out.println(list.toString());

        // Access Element
        // Time Complexity: O(N)
        int element = list.get(2);
        // 99
        System.out.println(element);

        // Search element
        // Time Complexity:O(N)
        int index = list.indexOf(99);
        // 2
        System.out.println(index);

        // Update element
        // Time Complexity: O(N)
        list.set(2, 88);
        //[1,2,88,3]
        System.out.println(list.toString());

        //Remove element
        //Time Complexity: O(N)
        list.remove(2);
        System.out.println(list.toString());
        
        // length
        //Time Complexity:O(1)
        int length=list.size();
        System.out.println(length);
    }

}