螺旋矩阵

桥里的风

于 2017-07-21 16:12:18 发布

阅读量225

点赞数

分类专栏： java

本文链接：https://blog.csdn.net/czqasdasdasd/article/details/75652848

版权

java 专栏收录该内容

6 篇文章 0 订阅

订阅专栏

螺旋矩阵

public static void juz(){
   int i = 1;
   int n = 10;
   int l = 0, h = 0;
   boolean right = true;
   boolean down = false;
   boolean left = false;
   boolean up = false;
   int[][] a = new int[n][n];
    
   while(i < n * n){
      if(right){
         if(l<n || a[h][l] == 0){
            a[h][l++] = i++;
         }
         
         if(l == n || a[h][l] > 0){
            l--;
            h++;
            right = false;
            down = true;
         }
      }
      
      if(down){
         if(h<n || a[h][l] == 0){
            a[h++][l] = i++;
         }
         
         if(h == n || a[h][l] > 0){
            h--;
            l--;
            down = false;
            left = true;
         }
      }
      
      if(left){
         if(l>=0 || a[h][l] == 0){
            a[h][l--] = i++;
         }
         
         if(l < 0 || a[h][l] > 0){
            h--;
            l++;
            left = false;
            up = true;
         }
      }
      
      if(up){
         if(a[h][l] == 0){
            a[h--][l] = i++;
         }
         
         if(a[h][l] > 0){
            h++;
            l++;
            up = false;
            right = true;
         }
      }
   }
   
   for(int b = 0; b < a.length; b++){
      for(int c = 0; c < a[b].length; c++){
         System.out.printf("%3d", a[b][c]);
      }
      System.out.println();
   }
   
}