leetcode 59. Spiral Matrix II

我在这里用了和leetcode 54 一样的思路开辟了一个和原矩阵同样大小的矩阵temp来存放是否输出过的标志位，然后按照向右，向左，向上，向下的顺时针顺序构造矩阵。

下面是这两道题的代码：

import java.util.ArrayList;
import java.util.List;


public class Solution {
	public List<Integer> spiralOrder(int[][] matrix) {
        List<Integer> result = new ArrayList<Integer>();
        int i,j; //i为行数,j为列数
        int count=0;
        
       // result.add(new Integer(matrix[0][0]));
        if(matrix.length == 0)
        	return result;
        int [][]temp = new int[matrix.length][];
        for(i=0;i<matrix.length;i++)
        	temp[i] = new int[matrix[i].length];
        
        
        int row = temp.length;
        for(i=0;i<row;i++)
        	for(j=0;j<temp[i].length;j++)
        		temp[i][j] = 0;
        
        i=j=0;
        //int flag = 1;  //第一个数
        result.add(new Integer(matrix[0][0]));
    	temp[0][0] = 1;
        while(true)
        {
        	while(j+1<temp[i].length && temp[i][j+1] == 0)
        	{  //向右
        		j++;
        		temp[i][j] = 1;
        		result.add(new Integer(matrix[i][j]));
        	}
        	
        	while(i+1 < temp.length && temp[i+1][j] == 0)
        	{//向下
        		i++;
        		temp[i][j] = 1;
        		result.add(new Integer(matrix[i][j]));
        	}  	

        	while(j-1 >= 0 && temp[i][j-1] == 0)
        	{//向左
        		j--;
        		temp[i][j] = 1;
        		result.add(new Integer(matrix[i][j]));
        	}
        	
        	while(i-1 >= 0 && temp[i-1][j] == 0)
        	{//向上
        		i--;
        		temp[i][j] = 1;
        		result.add(new Integer(matrix[i][j]));
        	}
        	
        	if((j+1==temp[i].length || temp[i][j+1] != 0) && (i+1 == temp.length || temp[i+1][j] != 0) && (j-1 < 0 || temp[i][j-1] != 0) && (i-1 < 0 || temp[i-1][j] != 0))
        		break;
        }
            return result;      
    }
	
public int[][] generateMatrix(int n) 
{
	int i,j,count;
	
	if(n==0)
		return null;
	int [][]res = new int[n][n];
	int [][]temp = new int[n][n];
	
	
	
	for(i=0;i<n;i++)
    	for(j=0;j<n;j++)
    		temp[i][j] = 0;
	 i=j=0;
     //int flag = 1;  //第一个数
	 count = 1;
	 res[0][0] = count++;
	 temp[0][0] = 1;
     while(true)
     {
     	while(j+1<n && temp[i][j+1] == 0)
     	{  //向右
     		j++;
     		temp[i][j] = 1;
     		res[i][j] = count++;
     	}
     	
     	while(i+1 < n && temp[i+1][j] == 0)
     	{//向下
     		i++;
     		temp[i][j] = 1;
     		res[i][j] = count++;
     	}  	

     	while(j-1 >= 0 && temp[i][j-1] == 0)
     	{//向左
     		j--;
     		temp[i][j] = 1;
     		res[i][j] = count++;
     	}
     	
     	while(i-1 >= 0 && temp[i-1][j] == 0)
     	{//向上
     		i--;
     		temp[i][j] = 1;
     		res[i][j] = count++;
     	}
     	
     	if((j+1==n || temp[i][j+1] != 0) && (i+1 == n || temp[i+1][j] != 0) && (j-1 < 0 || temp[i][j-1] != 0) && (i-1 < 0 || temp[i-1][j] != 0))
     		break;
     }

	return res;
}
	
	
	
	public static void main(String args[])
	{
		int i,j,n;
		//int[][] matrix = new int[][]{{1,2,3},{4,5,6},{7,8,9}};
		int[][] matrix = {{1,2,3},{4,5,6},{7,8,9}};
		List<Integer> result;
		result = new Solution().spiralOrder(matrix);
		for(i=0;i<result.size();i++)
		{
			System.out.print(result.get(i)+"__");
		}
		
		n=2;
		int [][]res = new int[n][n];
		res = new Solution().generateMatrix(n);
		System.out.println();
		for(i=0;i<n;i++)
		{
			for(j=0;j<n;j++)
				System.out.print(res[i][j]+"  ");
			System.out.println();
		}
		
		
	}
}