public class Solution {
    public List<Integer> spiralOrder(int[][] matrix) {
        ArrayList<Integer> array = new ArrayList<>();
        if(matrix.length == 0) return array;
        int rowtop = 0;
        int rowbottom = matrix.length-1;
        int colleft = 0;
        int colright = matrix[0].length-1;
        while(rowtop <= rowbottom && colleft <= colright){
            //travel from left to right
            for(int i = colleft ; i <= colright ; i++){
                array.add(matrix[rowtop][i]);
            }
            rowtop++;
            
            // travel from top to bottom
            for(int i = rowtop ; i <= rowbottom ; i++){
                array.add(matrix[i][colright]);
            }
            colright--;
            
            //travel from right to left
            if(rowbottom >= rowtop)
                for(int i = colright ; i >= colleft ; i--){
                    array.add(matrix[rowbottom][i]);
                }
            rowbottom--;
            
            // travel from bottom to top
            if(colleft <= colright)
                for(int i = rowbottom ; i >= rowtop ; i--){
                    array.add(matrix[i][colleft]);
                }
            colleft++;
            
        }
        return array;
    }
}