2021/4/21 剑指 Offer 29. 顺时针打印矩阵

第一种解法这个人真是个人才 coding的细节特别多

#include<iostream>
#include<algorithm>
#include<vector>
#include<unordered_map>
using namespace std;


class Solution {
public:
	vector<int> spiralOrder(vector<vector<int>>& matrix) {
		vector <int> res;
		if (matrix.empty()) return res;//这句一定要写在前面
		int rl = 0, rh = matrix.size() - 1; //记录待打印的矩阵上下边缘
		int cl = 0, ch = matrix[0].size() - 1; //记录待打印的矩阵左右边缘
		while (1){
			for (int i = cl; i <= ch; i++) res.push_back(matrix[rl][i]);//从左往右
			if (++rl > rh) break; //若超出边界，退出
			for (int i = rl; i <= rh; i++) res.push_back(matrix[i][ch]);//从上往下
			if (--ch < cl) break;
			for (int i = ch; i >= cl; i--) res.push_back(matrix[rh][i]);//从右往左
			if (--rh < rl) break;
			for (int i = rh; i >= rl; i--) res.push_back(matrix[i][cl]);//从下往上
			if (++cl > ch) break;
		}
		return res;
	}
};


int main()
{

	vector<vector<int>> matrix = { { 1, 2, 3 }, { 4, 5, 6 }, { 7, 8, 9 } };

	Solution a;
	vector<int> s = a.spiralOrder(matrix);
	for (auto k : s)
	{
		cout << k << ',';
	}
	cout << endl;
	
	
	system("pause");
	return 0;
}