20:時計回りの印刷マトリックス

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int m = in.nextInt();
        int[][] matrix = new int[n][m];
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                matrix[i][j] = in.nextInt();
            }
        }
        f(matrix);
    }
    
    public static void f(int[][] m) {
        //    a b，               ，          
        int ah = 0;
        int al = 0;
        int bh = m.length - 1;
        int bl = m[0].length - 1;
        while (ah <= bh && al <= bl) { //       ，        ，          
            printEdge(m, ah++, al++, bh--, bl--);
        }
    }
    
    public static void printEdge(int[][] m , int ah, int al, int bh, int bl) {
        //         
        if (ah == bh) {
            while (al <= bl) {
                System.out.print(m[ah][al++] + " ");    
            }
        } else if (al == bl) { //          
            while (ah <= bh) {
                System.out.print(m[ah++][al] + " ");
            }
        } else { //     
            int curC = al;
            int curR = ah;
            //      
            while (curC < bl) {
                System.out.print(m[curR][curC++] + " ");
            }
            //      
            while (curR < bh) {
                System.out.print(m[curR++][curC] + " ");
            }
            //      
            while (curC > al) {
                System.out.print(m[curR][curC--] + " ");
            }
            //      
            while (curR > ah) {
                System.out.print(m[curR--][curC] + " ");
            }
        }
    }
    
}