Java多重链表_java——链表、链表栈 LinkedListStack、链表队列 LinkedListQueue

packageDate_pacage;public class LinkedList{public static voidmain(String[] args) {

LinkedList linkedList = new LinkedList<>();for(int i = 0 ; i < 5 ; i ++) {

linkedList.addFirst(i);

System.out.println(linkedList);

}

linkedList.add(2, 666);

System.out.println(linkedList);

linkedList.remove(2);

System.out.println(linkedList);

}private classNode{publicE e;publicNode next;publicNode(E e, Node next) {this.e =e;this.next =next;

}publicNode(E e) {this(e, null);

}publicNode() {this(null, null);

}

@OverridepublicString toString() {returne.toString();

}

}privateNode dummyHead;private intsize;publicLinkedList() {

dummyHead= new Node(null, null);

size= 0;

}public intgetSize() {returnsize;

}public booleanisEmpty() {return size == 0;

}public void add(intindex, E e) {if(index < 0 || index >size) {throw new IllegalArgumentException("Add failed. Illegal index.");

}

Node prev=dummyHead;for(int i = 0 ; i < index ; i ++) {

prev=prev.next;

}//Node node = new Node(e);//node.next = prev.next;//prev.next = node;

prev.next = newNode(e, prev.next);

size++;

}public voidaddFirst(E e) {//Node node = new Node(e);//node.next = head;//head = node;

add(0, e);

}public voidaddLast(E e) {

add(size, e);

}public E get(intindex) {if(index < 0 || index >size) {throw new IllegalArgumentException("Get failed. Illegal index.");

}

Node cur=dummyHead.next;for(int i = 0 ; i < index ; i ++) {

cur=cur.next;

}returncur.e;

}publicE getFirst() {return get(0);

}publicE getLast() {return get(size - 1);

}//修改链表的第index位置的元素为e

public void set(intindex, E e) {if(index < 0 || index >size) {throw new IllegalArgumentException("Get failed. Illegal index.");

}

Node cur=dummyHead.next;for(int i = 0; i < index ; i ++) {

cur=cur.next;

}

cur.e=e;

}public booleancontains(E e) {

Node cur=dummyHead.next;while(cur != null){if(cur.e.equals(e)){return true;

}

cur=cur.next;

}return false;

}

@OverridepublicString toString() {

StringBuilder res= newStringBuilder();//Node cur = dummyHead.next;//while(cur != null) {//res.append(cur + "->");//cur = cur.next;//}

for(Node cur = dummyHead ; cur != null ; cur =cur.next) {

res.append(cur.e+ "->");

}

res.append("NULL");returnres.toString();

}public E remove(intindex) {if(index < 0 || index >size) {throw new IllegalArgumentException("Get failed. Illegal index.");

}

Node prev=dummyHead;for(int i = 0 ; i < index ; i ++) {

prev=prev.next;

}

Node retNode=prev.next;

prev.next=retNode.next;

retNode.next= null;

size--;returnretNode.e;

}publicE removeFirst() {return remove(0);

}publicE removrLast() {return remove(size - 1);

}

}