给定一个二维数组，螺旋矩阵顺时针排序

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

public class SpiralMatrix {
    public static void main(String[] args) {
        int[][] matrix = {
            { 1, 2, 3 },
            { 4, 5, 6 },
            { 7, 8, 9 }
        };
        int[] result = spiralOrder(matrix);
        for (int num : result) {
            System.out.print(num + " ");
        }
    }

	public static int[] spiralOrder(int[][] array){
        if(array.length == 0){
            return new int[0];
        }
        int m = array.length;
        int n = array[0].length;
        int[] dest = new int[m*n];
        int left=0, right=n-1, down = m-1, up = 0, index = 0;
        while (true){
            for(int i=left; i<=right; ++i){//从左到右
                dest[index++] = array[up][i];
            }
            if(++up > down) break;
            for (int i=up; i<= down; ++i){//从上到下
                dest[index++] = array[i][right];
            }
            if(--right < left) break;
            for(int i=right;i>=left; --i){//从右到左
                dest[index++] = array[down][i];
            }
            if(--down < up) break;
            for(int i=down; i>=up; --i){//从下到上
                dest[index++] = array[i][left];
            }
            if(++left > right) break;
        }
        return dest;
    }
}