✨ 添加新特性

crossoverJie · crossoverJie · commit deeee57b80cf · 2018-02-09T23:56:53.000+08:00
diff --git a/src/main/java/com/crossoverjie/algorithm/TwoArray.java b/src/main/java/com/crossoverjie/algorithm/TwoArray.java
@@ -15,14 +15,27 @@ public class TwoArray {
     private final static Logger LOGGER = LoggerFactory.getLogger(TwoArray.class);
 
 
-    int[][] matrix = new int[][]{
-            {1, 2, 8, 9},
-            {2, 4, 9, 12},
-            {4, 7, 10, 13},
-            {6, 8, 11, 15}
-    };
-
-    int rows = matrix.length; // 数组的行数
-    int cols = matrix[1].length; // 数组行的列数
+
+
+    public static void main(String[] args) {
+        int[][] matrix = new int[][]{
+                {1, 2, 8, 9},
+                {2, 4, 9, 12},
+                {4, 7, 10, 13},
+                {6, 8, 11, 15},
+                {7, 9, 12, 16}
+        };
+
+        // 数组的行数
+        int rows = matrix.length;
+        // 数组行的列数
+        int cols = matrix[1].length;
+
+        LOGGER.info(String.valueOf(rows));
+        LOGGER.info(String.valueOf(cols));
+
+    }
+
+
 
 }
diff --git a/src/main/java/com/crossoverjie/algorithm/TwoStackQueue.java b/src/main/java/com/crossoverjie/algorithm/TwoStackQueue.java
@@ -0,0 +1,27 @@
+package com.crossoverjie.algorithm;
+
+import java.util.Stack;
+
+/**
+ * Function: 两个栈实现队列
+ *
+ * @author crossoverJie
+ *         Date: 09/02/2018 23:51
+ * @since JDK 1.8
+ */
+public class TwoStackQueue {
+
+    private Stack input = new Stack() ;
+    private Stack out = new Stack() ;
+
+
+    /**
+     * 写入队列
+     * @param object
+     */
+    private void appendTail(Object object){
+        input.push(object) ;
+    }
+
+
+}
