leetcode--Spiral Matrix II

Given an integer n, generate a square matrix filled with elements from 1 ton² in spiral order.

For example,
Given n = 3,

You should return the following matrix:

[
 [ 1, 2, 3 ],
 [ 8, 9, 4 ],
 [ 7, 6, 5 ]
]

题意：给定n,得到n*n的环形数组

分类：数组

解法1：和leetcode--Spiral Matrix一样，只是访问过程变成赋值

[java]  view plain  copy

1. public class Solution {  
2.     public int[][] generateMatrix(int n) {  
3.         int[][] res = new int[n][n];  
4.         int count = 1;  
5.         int rows = n;      
6.         if(rows==0) return res;    
7.         int cols = n;      
8.         boolean vis[][] = new boolean[rows][cols];      
9.         int x = 0;                    
10.         while(x*2<cols && x*2<rows){      
11.             int endX = rows-x-1;      
12.             int endY = cols-x-1;      
13.             for(int i=x;i<=endY;i++){      
14.                 if(!vis[x][i]){      
15.                     res[x][i]=count++;      
16.                     vis[x][i] = true;      
17.                 }      
18.             }      
19.             for(int i=x+1;i<=endX;i++){      
20.                 if(!vis[i][endY]){      
21.                     res[i][endY]=count++;      
22.                     vis[i][endY] = true;      
23.                 }      
24.             }      
25.             for(int i=endY-1;i>=x;i--){      
26.                 if(!vis[endX][i]){      
27.                     res[endX][i]=count++;      
28.                     vis[endX][i] = true;      
29.                 }      
30.             }      
31.             for(int i=endX-1;i>x;i--){      
32.                 if(!vis[i][x]){      
33.                     res[i][x]=count++;  
34.                     vis[i][x] = true;      
35.                 }                     
36.             }                 
37.             x = x + 1;                
38.         }      
39.         return res;      
40.     }  
41. }  

解法2：优化了遍历过程

[java]  view plain  copy

1. public class Solution {  
2.     public int[][] generateMatrix(int n) {  
3.         int[][] res = new int[n][n];  
4.         if(n==0) return res;    
5.         int x = 0,y = 0;    
6.         int count = 0,limit = n*n;    
7.         int right = n-1,bottom = n-1,left = 0,top = 0;    
8.         while(count<limit){    
9.             while(count<limit&&y<=right){res[x][y++]=++count;}    
10.             y--;x++;top++;    
11.             while (count<limit&&x<=bottom) {res[x++][y]=++count;}    
12.             x--;y--;right--;    
13.             while(count<limit&&y>=left) {res[x][y--]=++count;}    
14.             x--;y++;bottom--;    
15.             while(count<limit&&x>=top) {res[x--][y]=++count;}    
16.             x++;y++;left++;    
17.         }    
18.         return res;    
19.     }  
20. } 

原文链接http://blog.csdn.net/crazy__chen/article/details/46402203