LeetCode

package LeetCode;


class Solution_59 {
    public int[][] generateMatrix(int n) {
        int[][] res = new int[n][n];    //定义生成矩阵

        //循环次数
        int loop = n / 2;

        //定义每次循环起始位置
        int startX = 0;
        int startY = 0;

        //定义偏移量
        int offset = 1;

        //定义起始位置的填充数字
        int count = 1;

        //定义中间位置
        int mid = n / 2;

        while(loop > 0){

            int i = startX;
            int j = startY;

            //模拟上侧从左到右  填充1,2,3,4
            for(;j < startY + n - offset; ++j){
                res[startX][j] = count++;

            }

            //模拟右侧从上到下  填充5,6,7,8
            for(; i < startX + n - offset; ++i){
                res[i][j] = count++;
            }

            //模拟下侧从右到左  填充9,10,11，12
            for(; j > startY; j--){
                res[i][j] = count++;
            }

            //模拟左侧从下到上
            for(; i > startX; i--){
                res[i][j] = count++;
            }

            loop--;     //进行下一次循环
            startX += 1;    //此时初始位置是（1,1）
            startY += 1;
            offset += 2;    //
        }
        if(n % 2 == 1){
            res[mid][mid] = count;
        }

        return res;
    }
}

public class leetcode_59 {
    public static void main(String[] args){
        Solution_59 sol_59 = new Solution_59();
        int[][] arr = sol_59.generateMatrix(5);
        for(int i = 0; i <= arr.length-1; i++){
            for(int j = 0; j <= arr.length-1; j++){
                System.out.print(arr[i][j] + "t");
            }
            System.out.println();
        }
    }
}