面试题29：顺时针打印矩阵

题目：输入一个矩阵，按照从外向里以顺时针的顺序依次打印出每一个数字。

#include<iostream>
#include<vector>
using namespace std;
void ClockwisePrint(vector<vector<int>>matrix) {
	//对于matrix[i][j]
	//horizontal记录j的打印范围
	//vertical记录i的打印范围
	//direction记录打印方向
	int horizontal_min = 0, honrizontal_max = matrix[0].size();
	int vertical_min = 0, vertical_max = matrix.size();
	int direction = 0;
	while ((honrizontal_max - horizontal_min) > 0 && (vertical_max - vertical_min) > 0) {
		bool visit = false;
		if (!visit && direction == 0) {//向右
			for (int i = horizontal_min; i < honrizontal_max; i++) {
				cout << matrix[vertical_min][i] << " ";
			}
			vertical_min++;
			direction++;
			visit = true;
		}
		else if (!visit && direction == 1) {//向下
			for (int i = vertical_min; i < vertical_max; i++) {
				cout << matrix[i][honrizontal_max - 1] << " ";
			}
			honrizontal_max--;
			direction++;
			visit = true;
		}
		else if (!visit && direction == 2) {//向左
			for (int i = honrizontal_max - 1; i >= horizontal_min; i--) {
				cout << matrix[vertical_max - 1][i] << " ";
			}
			vertical_max--;
			direction++;
			visit = true;
		}
		else if (!visit && direction == 3) {//向上
			for (int i = vertical_max - 1; i >= vertical_min; i--) {
				cout << matrix[i][horizontal_min] << " ";
			}
			horizontal_min++;
			direction = 0;
			visit = true;
		}
	}
}
int main() {
	int length = 5;
	int width = 1;
	vector<int>test_array(length, 0);
	vector<vector<int>>test(width, test_array);
	int count = 1;
	for (int i = 0; i < width; i++) {
		for (int j = 0; j < length; j++) {
			test[i][j] = count++;
		}
	}
	ClockwisePrint(test);
	return 0;
}