矩阵顺时针旋转90度

#include<iostream>
#include<queue>
using namespace std;
void rotate_circle(int matrix[][4],int circle_num,int len)
{
queue<int> temp1;
queue<int> temp2;
for (int i = circle_num - 1; i < len - circle_num; i++)//保存右边列
{
temp1.push(matrix[i][len - circle_num]);
}
for (int i = circle_num-1; i < len - circle_num; i++)//填充右边列
{
matrix[i][len - circle_num] = matrix[circle_num - 1][i];
}
for (int i = len - circle_num; i > circle_num - 1;i--)
{
temp2.push(matrix[len - circle_num][i]);//保存下边列
matrix[len - circle_num][i] = temp1.front();//填充下边列
temp1.pop();
}
for (int i = len - circle_num; i > circle_num - 1; i--)
{
temp1.push(matrix[i][circle_num - 1]);//保存左边列
matrix[i][circle_num-1] = temp2.front();//填充左边列
temp2.pop();
}
for (int i = circle_num - 1; i < len - circle_num; i++)
{
matrix[circle_num - 1][i] = temp1.front();
temp1.pop();
}
}
void matrix_rotate(int matrix[][4],int len)
{
int circle_nums = len / 2;
for (int i = 1; i <= circle_nums; i++)
{
rotate_circle(matrix, i, len);
}
}
int main()
{
int matrix[4][4] = { { 1, 2, 3, 4 }, { 5, 6, 7, 8 }, { 9, 10, 11, 12 }, { 13, 14, 15, 16 } };
matrix_rotate(matrix,4);
return 0;
}