剑指Offer（书）：顺时针打印数组

package com.gjjun.jzoffer;import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;

/**
 * 顺时针打印矩阵
 *
 * @author gjjun
 * @date 2018/8/21
 **/
public class Solution29 {
    public static void main(String[] args) {
        int[][] arr = new int[2][4];
        int num = 1;
        for (int i = 0; i < 2; i++) {
            for (int j = 0; j < 4; j++) {
                arr[i][j] = num;
                num++;
            }
        }
        System.out.println(Arrays.deepToString(arr));
        System.out.println(Arrays.toString(print(arr).toArray()));
    }

    public static ArrayList<Integer> print(int[][] array) {
        ArrayList<Integer> list = new ArrayList<>();
        if (array == null || array.length == 0) {
            return list;
        }
        int row = array.length;
        int col = array[0].length;
        int[][] temp = new int[row][col];
        temp[0][0] = 1;
        int i = 0;
        int j = 0;
        list.add(array[i][j]);
        int min = row > col ? col : row;
        min = (min & 1) == 1 ? min / 2 + 1 : min / 2;
        while (min-- > 0) {
            while (j < col - 1 && temp[i][j + 1] == 0) {
                list.add(array[i][j + 1]);
                temp[i][j + 1] = 1;
                j++;
            }
            while (i < row - 1 && temp[i + 1][j] == 0) {
                list.add(array[i + 1][j]);
                temp[i + 1][j] = 1;
                i++;
            }
            while (j > 0 && temp[i][j - 1] == 0) {
                list.add(array[i][j - 1]);
                temp[i][j - 1] = 1;
                j--;
            }
            while (i > 0 && temp[i - 1][j] == 0) {
                list.add(array[i - 1][j]);
                temp[i - 1][j] = 1;
                i--;
            }
        }
        return list;
    }
}