【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 {
public:
	vector<int> spiralOrder(vector<vector<int> > &matrix) {
		if (matrix.empty())
			return vector<int>();
		int colstart(-1), rowstart(0);
		int colend(matrix[0].size() - 1), rowend(matrix.size() - 1);
		vector<int> ret;
		while (1){
			if (++colstart > colend) break;
			for (int i = colstart; i <= colend; i++)
				ret.push_back(matrix[rowstart][i]);
			if (++rowstart > rowend) break;
			for (int i = rowstart; i <= rowend; i++)
				ret.push_back(matrix[i][colend]);
			if (colstart > --colend) break;
			for (int i = colend; i >= colstart; i--)
				ret.push_back(matrix[rowend][i]);
			if (rowstart > --rowend) break;
			for (int i = rowend; i >= rowstart; i--)
				ret.push_back(matrix[i][colstart]);
		}
		return ret;
	}
};