java实现环形螺旋打印

chenwj1103 · chenwj1103 · commit 1649a6b54d4a · 2017-11-06T22:25:31.000+08:00
diff --git a/src/main/java/com/chen/algorithm/rectangle/RingDemo.java b/src/main/java/com/chen/algorithm/rectangle/RingDemo.java
@@ -0,0 +1,99 @@
+package com.chen.algorithm.rectangle;
+
+/**
+ * User: chenweijie
+ * Date: 11/6/17
+ * Time: 9:52 PM
+ * Description: http://blog.csdn.net/terry84fun/article/details/4807521
+ */
+public class RingDemo {
+    /**
+     * @param n
+     * 打印螺旋举矩阵
+     */
+    public static void setArray(int n) {
+        int intA = 1;//初始化
+        int[][] array = new int[n][n];
+        int intB;
+        if (n % 2 != 0) {
+            intB = n / 2 + 1;//奇数时i循环次数
+        } else
+            intB = n / 2;//偶数时i循环次数
+        for (int i = 0; i < intB; i++) {//从外到里循环
+            //从左到右横的开始
+            for (int j = i; j < n - i; j++) {
+                array[i][j] = intA;
+                intA++;
+            }
+            //从上到下纵
+            for (int k = i + 1; k < n - i; k++) {
+                array[k][n - i - 1] = intA;
+                intA++;
+            }
+            //从右到左横
+            for (int l = n - i - 2; l >= i; l--) {
+                array[n - i - 1][l] = intA;
+                intA++;
+            }
+            //从下到上纵
+            for (int m = n - i - 2; m > i; m--) {
+                array[m][i] = intA;
+                intA++;
+            }
+        }
+        //输出数组
+        for (int i = 0; i < n; i++) {
+            for (int j = 0; j < n; j++) {
+                System.out.print(array[i][j] + " ");
+            }
+            System.out.println();
+        }
+    }
+    public static void setArray(int n,int m) {
+        int intA=1;
+        int array[][] = new int[n][m];
+        int intB;
+        if (n % 2 != 0) {
+            intB = n / 2 + 1;//奇数时i循环次数
+        } else
+            intB = n / 2;//偶数时i循环次数
+        for(int i = 0;i < intB; i++){//从外到里循环
+            //从左到右横的开始
+            for(int j = i; j<m-i; j++)
+            {
+                array[i][j]=intA;
+                intA++;
+            }
+            //从上到下
+            for(int k=i+1;k<n-i;k++)
+            {
+                array[k][m-i-1]=intA;
+                intA++;
+            }
+            //从右到左
+            for(int l=m-i-2; l>=i;l--)
+            {
+                array[n-i-1][l]=intA;
+                intA++;
+            }
+            //从下到上
+            for(int o=n-i-2;o>i;o--)
+            {
+                array[o][i]=intA;
+                intA++;
+            }
+        }
+        //输出数组
+        for (int i = 0; i < n; i++) {
+            for (int j = 0; j < n; j++) {
+                System.out.print(array[i][j] + " ");
+            }
+            System.out.println();
+        }
+    }
+    public static void main(String[] args) {
+        // TODO Auto-generated method stub
+        setArray(5);
+//        setArray(5,6);
+    }
+}
diff --git a/src/main/java/com/chen/algorithm/rectangle/TestSnakeCircle.java b/src/main/java/com/chen/algorithm/rectangle/TestSnakeCircle.java
@@ -0,0 +1,64 @@
+package com.chen.algorithm.rectangle;
+
+import org.junit.Test;
+
+import java.util.ArrayList;
+import java.util.Iterator;
+
+/**
+ * User: chenweijie
+ * Date: 11/6/17
+ * Time: 9:46 PM
+ * Description: http://www.cnblogs.com/flamebird/p/6840382.html
+ */
+public class TestSnakeCircle {
+
+    //判断N是偶数还是奇数，N为偶数时num=count,为奇数时num = count-1
+    public static void getArray(int num,int count){
+        ArrayList<ArrayList> listAll = new ArrayList<ArrayList>(count);//二维Arraylist
+        if(num != count){//奇数时先构建最核心的1
+            ArrayList start = new ArrayList(count);
+            start.add(1);
+            listAll.add(start);
+        }
+        for(int i=0;i<num/2;i++){
+            ArrayList listHead = new ArrayList();//构建要加的第一行
+            ArrayList listEnd = new ArrayList();//构建要加的最末行
+            int k;
+            if(num !=count)
+                k = 2*i+3;
+            else
+                k = 2*i+2;
+            for(int j=0;j<k;j++){
+                listHead.add(k*k-j);//填充要加的第一行
+                listEnd.add((k-2)*(k-2)+k-1+j);//填充要加的最末行
+                if(j<(k-2)){//原有的每行加头加尾
+                    ArrayList listTem = new ArrayList();
+                    listTem = listAll.get(j);
+                    listTem.add(0,(k-2)*(k-2)+1+j);
+                    listTem.add(k*k-k-j);
+                    listAll.set(j,listTem);
+                }
+            }
+            listAll.add(0,listHead);//加入第一行
+            listAll.add(listEnd);//加入最末行
+        }
+//输出
+        for(int i=0;i<count;i++){
+            ArrayList listTem = new ArrayList();
+            listTem = listAll.get(i);
+            for(Iterator iter = listTem.iterator(); iter.hasNext();){
+                int lastValue = count*count+1 - (int)iter.next();
+//没有标准化格式的输出
+//                System.out.print(lastValue+" ");
+                System.out.printf("%3d ",lastValue);
+            }
+            System.out.println();
+        }
+    }
+
+    @Test
+    public void test(){
+        getArray(4,5);
+    }
+}
