LeetCode: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].

代码：

class Solution
{
	vector<int> spiralOrder(vector<vector<int>> & matrix)
	{
		vector<int> result;
		if(matrix.size() == 0)
			return result; 
		int row_begin = 0;
		int row_end = matrix.size() - 1;
		int col_begin = 0;
		int col_end = matrix[0].size() - 1;

		while(row_begin <= row_end && col_begin <= col_end)
		{
			for(int i = col_begin; i <= col_end;i++)
				result.push_back(matrix[row_begin][i]);
			row_begin++;

			if(row_begin <= row_end && col_begin <= col_end)
				for(int i = row_begin;i <= row_end;i++)
					result.push_back(matrix[i][col_end]);
			col_end--;

			if(row_begin <= row_end && col_begin <= col_end)
				for(int i = col_end;i >= col_begin;i--)
					result.push_back(matrix[row_end][i]);
			row_end--;

			if(row_begin <= row_end && col_begin <= col_end)
				for(int i = row_end;i >= row_begin;i--)
					result.push_back(matrix[i][col_begin]);
			col_begin++;
		}
		return result;
	}
};