split data structure into queue and stack

Author: billryan

codes/algorithm-java/src/test/java/basic/DataStructureTest.java

@@ -4,9 +4,6 @@
 import org.slf4j.Logger;
 import org.slf4j.LoggerFactory;
 
-import java.util.Deque;
-import java.util.Queue;
-
 /**
  * @author billryan
  * @date 10/8/2019 10:59
@@ -15,37 +12,4 @@ public class DataStructureTest {
 
     private static final Logger log = LoggerFactory.getLogger(DataStructureTest.class);
 
-    @Test
-    public void testQueue() {
-        DataStructure<Integer> ds = new DataStructure<>();
-        Queue<Integer> queue = ds.getQueue();
-        queue.offer(1);
-        queue.offer(2);
-        queue.offer(3);
-
-        int peek = 1;
-        while (!queue.isEmpty()) {
-            int queuePeek = queue.poll();
-            log.info("queue peek: {}", queuePeek);
-            assert peek == queuePeek;
-            peek++;
-        }
-    }
-
-    @Test
-    public void testStack() {
-        DataStructure<Integer> ds = new DataStructure<>();
-        Deque<Integer> stack = ds.getStack();
-        stack.push(1);
-        stack.push(2);
-        stack.push(3);
-
-        int peek = 3;
-        while (!stack.isEmpty()) {
-            int stackPeek = stack.pop();
-            log.info("stack peek: {}", stackPeek);
-            assert peek == stackPeek;
-            peek--;
-        }
-    }
 }

codes/algorithm-java/src/test/java/basic/QueueTest.java

@@ -0,0 +1,33 @@
+package basic;
+
+import org.junit.Test;
+import org.slf4j.Logger;
+import org.slf4j.LoggerFactory;
+
+import java.util.LinkedList;
+import java.util.Queue;
+
+/**
+ * @author billryan
+ * @date 10/8/2019 12:05
+ */
+public class QueueTest {
+
+    private static final Logger log = LoggerFactory.getLogger(QueueTest.class);
+
+    @Test
+    public void testQueue() {
+        Queue<Integer> queue = new LinkedList<>();
+        queue.offer(1);
+        queue.offer(2);
+        queue.offer(3);
+
+        int peek = 1;
+        while (!queue.isEmpty()) {
+            int queuePeek = queue.poll();
+            log.info("queue peek: {}", queuePeek);
+            assert peek == queuePeek;
+            peek++;
+        }
+    }
+}

codes/algorithm-java/src/test/java/basic/StackTest.java

@@ -0,0 +1,33 @@
+package basic;
+
+import org.junit.Test;
+import org.slf4j.Logger;
+import org.slf4j.LoggerFactory;
+
+import java.util.ArrayDeque;
+import java.util.Deque;
+
+/**
+ * @author billryan
+ * @date 10/8/2019 12:04
+ */
+public class StackTest {
+
+    private static final Logger log = LoggerFactory.getLogger(StackTest.class);
+
+    @Test
+    public void testStack() {
+        Deque<Integer> stack = new ArrayDeque<>();
+        stack.push(1);
+        stack.push(2);
+        stack.push(3);
+
+        int peek = 3;
+        while (!stack.isEmpty()) {
+            int stackPeek = stack.pop();
+            log.info("stack peek: {}", stackPeek);
+            assert peek == stackPeek;
+            peek--;
+        }
+    }
+}