LeetCode 59. Spiral Matrix II(헬리컬 매트릭스 II java)

예:

아이디어:

코드:

    public int[][] generateMatrix(int n){
        if(n == 0) return new int[0][0];
        if(n == 1) {
            int[][] n1 = new int[1][1];
            n1[0][0] = 1;
            return n1;
        }
        int matrix[][] = new int[n][n];
        int i = 0, j = 0, wid = n, high = n, go = 0,k = 1;
        while (k < n * n) {
            //           
            switch (go) {
            //     ,      
            case 0:
                while (j < wid) {
                    matrix[i][j] = k;
                    k++;
                    j++;
                }
                j--;
                i++;
                go++;
                break;
            case 1:
                while (i < high - 1) {
                    matrix[i][j] = k;
                    k++;
                    i++;
                }
                go++;
                break;
            case 2:
                while (j >= n - wid) {
                    matrix[i][j] = k;
                    k++;
                    j--;
                }
                j++;
                i--;
                go++;
                high--;
                break;
            case 3:
                while (i > n - high) {
                    matrix[i][j] = k;
                    k++;
                    i--;
                }
                go = 0;
                wid--;
                break;
            }
        }
        return matrix;
    }

요약: