### 實現
~~~
public class LinkedList<E> {
private class Node {
public E e;
public Node next;
public Node(E e, Node next) {
this.e = e;
this.next = next;
}
public Node(E e) {
this(e, null);
}
public Node() {
this(null, null);
}
@Override
public String toString() {
return e.toString();
}
}
private Node dummyHead; //存儲鏈表頭
private int size; //記錄容量
public LinkedList() {
dummyHead = new Node(null, null); //虛擬頭
size = 0;
}
//獲取鏈表中的元素個數
public int getSize() {
return size;
}
//返回鏈表是否為空
public boolean isEmpty() {
return size == 0;
}
//在鏈表的index(0-based)位置添加新的元素e .索引在鏈表中不是一個常用的操作,僅僅是練習用
public void add(int index, E e) {
if(index < 0 || index > size)
throw new IllegalArgumentException("Add failed . Illegal index.");
Node prve = dummyHead;
for(int i = 0; i < index; i++) {
prve = prve.next;
}
prve.next = new Node(e, prve.next);
size++;
}
//在鏈表頭添加新的元素e
public void addFirst(E e) {
add(0, e);
}
//在鏈表末尾添加新的元素e
public void addLast(E e) {
add(size, e);
}
//獲取鏈表的第index(0-based)個位置的元素 . 在鏈表中不是一個常用的操作,練習用
public E get(int index) {
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;
}
return cur.e;
}
//獲取鏈表第一個元素
public E getFirst() {
return get(0);
}
//獲取鏈表最后一個元素
public E getLast() {
return get(size - 1);
}
//修改鏈表的第index(0-based)個位置的元素e .在鏈表中不是一個常用的操作,練習用
public void set(int index, E e) {
if(index < 0 || index >= size)
throw new IllegalArgumentException("Update failed. Illegal index.");
Node cur = dummyHead.next;
for(int i = 0; i < index; i++) {
cur = cur.next;
}
cur.e = e;
}
//查找鏈表中是否有元素e
public boolean contains(E e) {
Node cur = dummyHead.next;
while(cur != null) {
if(cur.e.equals(e)) {
return true;
}
cur = cur.next;
}
return false;
}
//從鏈表中刪除index(0-based)位置的元素,返回刪除的元素 .練習用
public E remove(int index) {
if(index < 0 || index >= size)
throw new IllegalArgumentException("Remove failed. index is index.");
Node prve = dummyHead;
for(int i = 0; i < index; i++) {
prve = prve.next;
}
Node retNode = prve.next;
prve.next = retNode.next;
retNode.next = null;
size--;
return retNode.e;
}
//從鏈表中刪除第一個元素,返回刪除元素
public E removeFirst() {
return remove(0);
}
//從鏈表中刪除最后一個元素,返回刪除元素
public E removeLast() {
return remove(size - 1);
}
//遍歷鏈表元素
@Override
public String toString() {
StringBuilder res = new StringBuilder();
// Node cur = dummyHead.next;
// while(cur != null) {
// res.append(cur + "->");
// cur = cur.next;
// }
for(Node cur = dummyHead.next; cur != null; cur = cur.next) {
res.append(cur + "->");
}
res.append("NULL");
return res.toString();
}
}
~~~
