single linked list

cookfront · cookfront · commit 62bee68b7648 · 2017-05-10T00:43:35.000+08:00
diff --git a/src/ch03/exercises/e11/README.md b/src/ch03/exercises/e11/README.md
@@ -0,0 +1,13 @@
+# 3.11
+
+## 题目
+
+假设单链表使用一个头节点实现，但无尾节点，并假设它只保留对该节点的引用。编写一个类，包含
+
+a. 返回链表大小的方法
+b. 打印链表的方法
+c. 测试值x是否含于链表的方法
+d. 如果值x尚未含于链表，添加值x到该链表的方法
+e. 如果值x含于链表，将x从该链表中删除的方法
+
+## 答案
diff --git a/src/ch03/exercises/e11/SingleLinkedList.java b/src/ch03/exercises/e11/SingleLinkedList.java
@@ -0,0 +1,93 @@
+package ch03.exercises.e11;
+
+/**
+ * Created by cookfront on 2017/5/10.
+ */
+public class SingleLinkedList<AnyType> {
+    private static class Node<AnyType> {
+        public AnyType data;
+        public Node<AnyType> next;
+
+        public Node(AnyType data, Node<AnyType> next) {
+            this.data = data;
+            this.next = next;
+        }
+    }
+
+    private Node<AnyType> head;
+    private int theSize;
+
+    public boolean contains(AnyType x) {
+        Node<AnyType> p = head.next;
+        while (p != null) {
+            if (x.equals(p.data)) {
+                return true;
+            }
+            p = p.next;
+        }
+        return false;
+    }
+
+    public void print() {
+        Node<AnyType> p = head.next;
+        while (p != null) {
+            System.out.print(p.data + " ");
+            p = p.next;
+        }
+        System.out.println();
+    }
+
+    public int size() {
+        return theSize;
+    }
+
+    public boolean add(AnyType x) {
+        if (contains(x)) {
+            return false;
+        }
+
+        Node<AnyType> p = new Node<>(x, head.next);
+        head.next = p;
+        theSize++;
+
+        return true;
+    }
+
+    public boolean remove(AnyType x) {
+        if (!contains(x)) {
+            return false;
+        }
+
+        Node<AnyType> prev = head;
+        Node<AnyType> p = head.next;
+
+        while (!p.data.equals(x)) {
+            prev = prev.next;
+            p = p.next;
+        }
+        prev.next = p;
+        theSize--;
+
+        return true;
+    }
+
+    public static void main(String ...args) {
+        SingleLinkedList<Integer> testList = new SingleLinkedList<>();
+
+        System.out.println("list size: " + testList.size());
+
+        testList.add(1);
+        testList.add(2);
+        testList.add(3);
+
+        testList.print();
+
+        if (testList.contains(3)) {
+            System.out.println("test list have 3!");
+        }
+
+        testList.remove(2);
+
+        testList.print();
+    }
+}
