Leetcode 54. Spiral Matrix

Given a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order.

For example,
Given the following matrix:

[
 [ 1, 2, 3 ],
 [ 4, 5, 6 ],
 [ 7, 8, 9 ]
]

You should return [1,2,3,6,9,8,7,4,5].

Analysis, this is quite easy ,and I have met this question for several times. Just remember to jump from the loop imediately

public class Solution {
    public List<Integer> spiralOrder(int[][] matrix) {
      //This is to spiral return some value.
        List<Integer> result = new LinkedList<Integer>();
        int top = 0;
        int bottom = matrix.length - 1;
        if(bottom < 0)
          return result;
        int left = 0;
        int right = matrix[0].length - 1;
        if(right < 0)
          return result;
        while(top <= bottom && left <= right){
          for(int i = left; i <= right; i++){
            result.add(matrix[top][i]);
          }
          top++;
          if(top > bottom)
            break;
          for(int i = top; i <= bottom; i++){
            result.add(matrix[i][right]);
          }
          right--;
          if(left > right)
            break;
          for(int i = right; i >= left; i--){
            result.add(matrix[bottom][i]);
          }
          bottom--;
          if(top > bottom)
            break;

          for(int i = bottom; i >= top; i--){
            result.add(matrix[i][left]);
          }
          left++;
          if(left > right)
            break;
        }
        return result;
    }
}