Leetcode #54

gistfile1.txt

public List<Integer> spiralOrder(int[][] matrix) {
        List<Integer> result = new ArrayList<Integer>();
        if(matrix == null || matrix.length == 0)
            return result;
        int endy=matrix.length;
        int endx=matrix[0].length;
        int starty = 0;
        int startx = 0;
        while(startx!=endx && starty!=endy){
            if(starty < endy){
                for(int i=startx;i<endx;i++){
                    result.add(matrix[starty][i]);
                }
                starty++;
            }
            if(startx < endx){
                for(int i=starty;i<endy;i++){
                    result.add(matrix[i][endx-1]);
                }
                endx--;
            }
            if(starty < endy){
                for(int i=endx-1; i>=startx;i--){
                    result.add(matrix[endy-1][i]);
                }
                endy--;
            }
            if(startx < endx){
                for(int i=endy-1;i>=starty;i--){
                    result.add(matrix[i][startx]);
                }
                startx++;
            }
        }
        return result;
    }