Set

Author: litoo

app/src/main/java/com/example/datastructure/BSTSet.java

@@ -0,0 +1,32 @@
+package com.example.datastructure;
+
+/**
+ * 基于二分搜索树的set
+ */
+public class BSTSet<E extends Comparable<E>> implements Set<E>{
+    private BinarySearchTree<E> mBst;
+
+    public BSTSet() {
+        this.mBst = new BinarySearchTree<>();
+    }
+
+    @Override
+    public int getSize() {
+        return mBst.getSize();
+    }
+
+    @Override
+    public boolean isEmpty() {
+        return mBst.isEmpty();
+    }
+
+    @Override
+    public void add(E e) {
+        mBst.add(e);
+    }
+
+    @Override
+    public boolean contains(E e) {
+        return mBst.contains(e);
+    }
+}

app/src/main/java/com/example/datastructure/BinarySearchTree.java

@@ -89,7 +89,7 @@ public void inOrder() {
         inOrder(root);
     }
 
-    private void inOrder(Node node){
+    private void inOrder(Node node) {
         inOrder(node.left);
         Log.d("访问节点", node.e.toString());
         inOrder(node.right);
@@ -101,7 +101,7 @@ public void postOrder() {
         postOrder(root);
     }
 
-    private void postOrder(Node node){
+    private void postOrder(Node node) {
         postOrder(node.left);
         postOrder(node.right);
         Log.d("访问节点", node.e.toString());
@@ -111,6 +111,10 @@ public boolean isEmpty() {
         return size == 0;
     }
 
+    public int getSize() {
+        return size;
+    }
+
     private class Node {
         public E e;
         public Node left, right;

app/src/main/java/com/example/datastructure/LinkedListSet.java

@@ -0,0 +1,35 @@
+package com.example.datastructure;
+
+/**
+ * 基于链表的Set
+ */
+public class LinkedListSet<E> implements Set<E>{
+    private LinkedList<E> linkedList;
+
+    public LinkedListSet() {
+        this.linkedList = new LinkedList<>();
+    }
+
+    @Override
+    public int getSize() {
+        return linkedList.getSize();
+    }
+
+    @Override
+    public boolean isEmpty() {
+        return linkedList.isEmpty();
+    }
+
+    //链表本身不去重
+    @Override
+    public void add(E e) {
+        if (!linkedList.contains(e)){
+            linkedList.addFirst(e);
+        }
+    }
+
+    @Override
+    public boolean contains(E e) {
+        return linkedList.contains(e);
+    }
+}

app/src/main/java/com/example/datastructure/Set.java

@@ -0,0 +1,8 @@
+package com.example.datastructure;
+
+public interface Set<E> {
+    int getSize();
+    boolean isEmpty();
+    void add(E e);
+    boolean contains(E e);
+}