顺时针旋转矩阵

假设矩阵为
1 2 3
4 5 6
7 8 9
旋转之后，变为
7 4 1
8 5 2
9 6 3

class Solution {
public:
	vector> rotateMatrix(vector > mat, int n) {
		int N = mat.size();
		vector> v;
		stack Martix_stack;
		int num = 0;
		for (int i = 0; i < N; i++){
			for (int j = 0; j < N; j++){
				Martix_stack.push(mat[j][i]);
				//一列放进栈中，比如147然后258然后369
			}
			vector vi;
			for (int m = 0; m < N; m++){
				vi.push_back(Martix_stack.top());
				//再把栈中的数据弹出到vector容器里面作为一行
				Martix_stack.pop();
			}
			v.push_back(vi);
			//把一行塞入二维数组里面
		}
		return v;
	}
};