zoukankan      html  css  js  c++  java
  • 【4】LinkedList使用方法大全!!!

    初始化

    (1)List<String> list1 = new LinkedList<>();
    (2)List<String> list2 = new LinkedList<>(
             Arrays.asList(new String[]{"a", "b", "c"}
       );
      
    List<String> list3 = new LinkedList<>(){
    {
    add("china");
    add("english");
    }
    };

    基本用法

    add:
    boolean add(E e):        在链表后添加一个元素,如果成功,返回true,否则返回false; void addFirst(E e):       在链表头部插入一个元素; addLast(E e):          在链表尾部添加一个元素; void add(int index, E element): 在指定位置插入一个元素。


    remove:
    E remove();                 移除链表中第一个元素;
    boolean remove(Object o):          移除链表中指定的元素;
    E remove(int index):            移除链表中指定位置的元素;
    E removeFirst():              移除链表中第一个元素,与remove类似;
    E removeLast():               移除链表中最后一个元素;
    boolean removeFirstOccurrence(Object o):  移除链表中第一次出现所在位置的元素;
    boolean removeLastOccurrence(Object o):  移除链表中最后一次出现所在位置的元素;

    get:
    E get(int index):  按照下边获取元素;
    E getFirst():    获取第一个元素;
    E getLast():     获取第二个元素;

    push:
    void push(E e):   与addFirst一样,实际上它就是addFirst;

    pop:
    E pop():       与removeFirst一样,实际上它就是removeFirst;

    poll:
    E poll():      查询并移除第一个元素;

    peek:
    E peek():      获取第一个元素,但是不移除;
    E peekFirst():    获取第一个元素,但是不移除;
    E peekLast():    获取最后一个元素,但是不移除;

    offer:
    boolean offer(E e):    在链表尾部插入一个元素;
    boolean offerFirst(E e):  与addFirst一样,实际上它就是addFirst;
    boolean offerLast(E e):  与addLast一样,实际上它就是addLast;

    contains
    element
    set
    subList
    package pakage11;
    import java.awt.*;
    import java.io.*;
    import java.math.BigInteger;
    import java.rmi.RemoteException;
    import  java.util.*;
    import java.text.*;
    import java.util.regex.Pattern;
    import java.util.ArrayList;
    import java.util.Collections;
    import java.util.LinkedList;
    import java.util.ArrayList;
    import java.util.List;
    
    
    public class helloWd{
        public static void main(String[] args){
            LinkedList<String> list = new LinkedList<>();
    
            // 增加add
            System.out.println("------------add------------");
            list.add("python");
            list.add("c++");
            list.add("lua");
            list.add("java");
            list.add("python");
            list.add("c++");
            list.add("lua");
            list.add("java");
            System.out.println("前list: "+list);
    
            list.addFirst("c#");
            list.addLast("mongodb");
            list.add(3, "json");
            System.out.println("后list: "+list+"
    ");
         // 删除remove
            System.out.println("------------remove-------------");
            list.remove();
            System.out.println("remove1:  "+list);
    
            list.remove("java");
            System.out.println("remove2:  "+list);
    
            list.remove(2);
            System.out.println("remove3   "+list);
    
            list.removeFirst();
            System.out.println("removeFirst: "+list);
    
            list.removeLast();
            System.out.println("removeLast: "+list);
    
            list.removeFirstOccurrence("c++");
            System.out.println("removeFirstOccurrence: "+list);
    
            list.removeLastOccurrence("lua");
            System.out.println("removeLastOccurrence: "+list+"
    ");
    
            // 获取get
            System.out.println("------------get------------");
            System.out.println("get:      "+list.get(2));
            System.out.println("getFirst: "+list.getFirst());
            System.out.println("getLast:  "+list.getLast()+"
    ");
    
            // push
            System.out.println("------------push------------");
            list.push("mongodb");
            System.out.println("push:  "+list+"
    ");
    
            // pop
            System.out.println("------------pop------------");
            System.out.println(list.pop());
            System.out.println("pop:   "+list+"
    ");
    
            // poll
            System.out.println("------------poll------------");
            System.out.println(list.poll());
            System.out.println("poll:  "+list+"
    ");
    
            // peek
            System.out.println("------------peek------------");
            System.out.println("peek:      "+list.peek());
            System.out.println("peekFirst: "+list.peekFirst());
            System.out.println("peekLast:  "+list.peekLast()+"
    ");
    
            // offer
            System.out.println("------------offer------------");
            list.offer("mongodb");
            System.out.println("offer:      "+list);
            list.offerFirst("xml");
            System.out.println("offerFirst: "+list);
            list.offerLast("lua");
            System.out.println("offerLast:  "+list+"
    ");
    
            // contains
            System.out.println("------------contains------------");
            System.out.println("contains: "+list.contains("xml")+"
    ");
    
            // element
            System.out.println("------------element------------");
            System.out.println("element:  "+list.element()+"
    ");
    
            // set
            System.out.println("------------element------------");
            System.out.println("set:      "+list.set(3,"set"));
            System.out.println("after:    "+list+"
    ");
    
            // subList
            System.out.println("------------element------------");
            System.out.println("subList:  "+list.subList(1,4));
            System.out.println("after:    "+list);
    
        }
    }

     

     

     

    做一个优秀的程序媛
  • 相关阅读:
    BZOJ 2299 向量
    BZOJ 1237 配对
    BZOJ 2226 LCMSum
    BZOJ 1876 SuperGCD
    查漏补缺:C++STL简述(容器部分)
    查漏补缺:Linux进程与线程的区别
    码海拾遗:常用的其中排序算法
    码海拾遗:简述C++(一)
    码海拾遗:简单的链表类
    码海拾遗:位运算实现加减乘除
  • 原文地址:https://www.cnblogs.com/oytt/p/14153314.html
Copyright © 2011-2022 走看看