add TestClockwiseOutput

chenwj1103 · chenwj1103 · commit 7dd40b3401b7 · 2017-10-17T22:15:38.000+08:00
diff --git a/src/main/java/com/chen/algorithm/mergeArray/ArraySort.java b/src/main/java/com/chen/algorithm/mergeArray/ArraySort.java
@@ -1,4 +1,4 @@
-package com.chen.algorithms;
+package com.chen.algorithm.mergeArray;
 
 /**
  * 两个有序数组合并为一个有序数组
diff --git a/src/main/java/com/chen/algorithm/rectangle/TestClockwiseOutput.java b/src/main/java/com/chen/algorithm/rectangle/TestClockwiseOutput.java
@@ -0,0 +1,55 @@
+package com.chen.algorithm.rectangle;
+
+import org.junit.Test;
+
+/**
+ * User: chenweijie
+ * Date: 10/16/17
+ * Time: 11:30 PM
+ * Description:输入一个矩阵，按照从外向里以顺时针的顺序
+ * 一次打印出每一个数字 （http://www.cnblogs.com/sunniest/p/4596182.html）
+ */
+public class TestClockwiseOutput {
+
+
+    @Test
+    public void test() {
+        int[][] num = new int[100][100];
+        int n = 3;
+        int count = 1;
+        for (int i = 0; i < n; i++) {
+            for (int j = 0; j < n; j++) {
+                num[i][j] = count++;
+            }
+        }
+        output(num, 0, n - 1);
+    }
+
+
+    public void output(int[][] num, int start, int end) {
+
+        if (start > end || end <= 0) {
+            return;
+        }
+
+        for (int i = start; i <= end; i++) {
+            System.out.println(num[start][i]);
+        }
+
+        for (int i = start + 1; i <= end; i++) {
+            System.out.println(num[i][end]);
+        }
+
+        for (int i = end - 1; i >= start; i--) {
+            System.out.println(num[end][i]);
+        }
+
+        for (int i = end - 1; i > start; i--) {
+            System.out.println(num[i][start]);
+        }
+
+        output(num, start + 1, end - 1);
+
+    }
+
+}

Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-package com.chen.algorithms;`
	`1`	`+package com.chen.algorithm.mergeArray;`
`2`	`2`
`3`	`3`	`/**`
`4`	`4`	`* 两个有序数组合并为一个有序数组`