数据结构学习（四） Java链表实现

?

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155

package linklist;   /**  * @Title: LinkedListDemo  * @ProjectName demo  */ public class LinkedListDemo<E> {       private class Node {         private E e;         private 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 int size;     private Node dummyHead;       public LinkedListDemo() {         size = 0;         dummyHead = new Node();     }       public int getSize() {         return this.size;     }       public boolean isEmpty() {         return size == 0;     }       public void add(int index, E e) {         if (index < 0 || index > size) {             throw new IllegalArgumentException("add error index.");         }         Node prev = dummyHead;         for (int i = 0; i < index; i++) {             prev = prev.next;         }         prev.next = new Node(e, prev.next);         size ++;     }       public void addFirst(E e) {         add(0, e);     }       public void addLast(E e) {         add(size, e);     }       public E remove(int index) {         if (index < 0 || index >= size) {             throw new IllegalArgumentException("remove error index.");         }         Node prev = dummyHead;         for (int i = 0; i < index; i++) {             prev = prev.next;         }         Node curNode = prev.next;         prev.next = curNode.next;         curNode.next = null;         return curNode.e;     }       public E removeFirst() {         return remove(0);     }       public E removeLast() {         return remove(size - 1);     }     public void removeElement(E e){         Node prev = dummyHead;         while (prev.next != null) {             if (prev.next.e.equals(e)) {                 break;             }             prev = prev.next;         }         if (prev.next != null) {             Node delNode = prev.next;             prev.next = delNode.next;             delNode.next = null;             size --;         }     }       public void set(int index, E e) {         if (index < 0 || index > size) {             throw new IllegalArgumentException("set error index");         }         Node cur = dummyHead.next;         for (int i = 0; i < index; i++) {             cur = cur.next;         }         cur.e = e;     }       public E get(int index) {         if (index < 0 || index >= size) {             throw new IllegalArgumentException("Get error 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);     }                     public boolean contains(E e) {         Node cur = dummyHead.next;         while (cur != null) {             if (cur.e.equals(e)) {                 return true;             }             cur = cur.next;         }         return false;     }       @Override     public String toString() {         StringBuilder sb = new StringBuilder();         for (Node cur = dummyHead.next; cur != null; cur = cur.next) {             sb.append(cur.toString() + "--->");         }         sb.append("NULL");         return sb.toString();     } }