趣味算法

 

1234
5678
90ab
cdef
要求输出12348bfedc9567a0

考虑一个蚂蚁，它当前坐标x，y，它的运动方向，4个。每次撞到墙，右转，当前状态下的4面墙...........

 

1. public class TEST2 
2. {
3.     public static void main(String[] args) {
4.         char[][] all = {
5.                 {'1','2','3','4'},
6.                 {'5','6','7','8'},
7.                 {'9','0','a','b'},
8.                 {'c','d','e','f'},
9.             };
10.         StringBuffer result = new StringBuffer();   
11.         int sept = 1;   //蚂蚁的移动方向,右和下是1,左和上是-1
12.         int x = 0;      //蚂蚁的坐标
13.         int y = 0;      //蚂蚁的坐标
14.         int xMax = all[0].length;//蚂蚁的移动范围
15.         int xMin = 0;           //蚂蚁的移动范围
16.         int yMax = all.length;  //蚂蚁的移动范围
17.         int yMin = 0;           //蚂蚁的移动范围
18.         boolean isRow = true;   //横向还是纵向移动
19.         
20.         for(int i=0; i<all[0].length*all.length; i++){
21.             if(isRow){
22.                 result.append(all[y][x]);
23.                 if(x+sept < xMax && x+sept >= xMin){    //在横向范围内则x坐标+或-1                
24.                     x += sept;
25.                 }else{
26.                     if(sept == 1){  //否则纵坐标+或-1
27.                         yMin += 1;
28.                     }else{
29.                         yMax -= 1;
30.                     }
31.                     y += sept;      //避免角上的重复走
32.                     isRow = false;  //变向
33.                 }
34.             }else{
35.                 result.append(all[y][x]);
36.                 if(y+sept < yMax && y+sept >= yMin){                    
37.                     y += sept;
38.                 }else{
39.                     if(sept == 1){
40.                         xMax -= 1;
41.                     }else{
42.                         xMin += 1;
43.                     }                   
44.                     isRow = true;
45.                     sept = -sept;
46.                     x += sept;
47.                 }
48.             }           
49.         }
50.         System.out.println(result.toString());
51.     }
52. }

 

或者

 

 

1. public class TEST2 
2. {
3.      public static void main(String[] args) {
5.             char[][] chars = {
6.                     {'1','2','3','4'},
7.                     {'5','6','7','8'},
8.                     {'9','0','a','b'},
9.                     {'c','d','e','f'}};
11.             int columnNum = chars[0].length;
12.             int rowNum = chars.length;
14.             printCharArray(rowNum, columnNum, chars);
15.         }
17.         private static void printCharArray(int rowNum, int columnNum, char[][] chars) {
19.             //print the first row of given array 
20.             for (int i = 0; i < columnNum; i++) {
21.                 System.out.print(chars[0][i]);
22.             }
24.             //swap rows with columns of sub-array 
25.             if (rowNum > 0 && columnNum > 0) {
26.                 int newRowNum = columnNum;
27.                 int newColumnNum = rowNum - 1;
28.                 char[][] newChars = new char[newRowNum][newColumnNum];
29.                 for (int i = 0; i < newRowNum; i++) {
30.                     for (int j = 0; j < newColumnNum; j++) {
31.                         newChars[i][j] = chars[j + 1][newRowNum - i - 1];
32.                     }
33.                 }
35.                 //print the sub-array recursively 
36.                 printCharArray(newRowNum, newColumnNum, newChars);
37.             }
38.         }
39. }