1 编程题:请将下面的二维数组进行旋转90度;
{11 12 13 14 15
21 22 23 24 25
31 32 33 34 35
41 42 43 44 45}
首先,旋转90度后,x,y的变换规律,
(0,0)-->(0,3) (0,1)-->(1,3) (0,2)-->(2,3) (0,3)-->(3,3) (0,4)-->(4,3)
...
(3,0)-->(0,0) (3,1)-->(1,0) (3,2)-->(2,0) (3,3)-->(3,0) (3,4)-->(4,0)
由以上规律,得
#include <iostream>
using namespace std;
//二维数组做函数形参
int rotate90(int (*a)[5], int (*b)[4], int bw, int bh)
{
for (int i=0;i<bh;i++)//5
{
for (int j=0;j<bw;j++)//4
{
b[i][j] = a[bw-1-j][i];
}
}
return 0;
}
int main()
{
//将二维数组旋转90度
int a[4][5] = { 11, 12, 13, 14, 15,
21, 22, 23, 24, 25,
31, 32, 33, 34, 35,
41, 42, 43, 44, 45
};
int b[5][4] = { 0 };
rotate90(a,b,4,5);
for (int i=0;i<5;i++)
{
cout << b[i][0] << ", " << b[i][1] << ", " << b[i][2] << ", " << b[i][3] << endl;
}
system("pause");
return 0;
}
参考文章:
1. https://blog.csdn.net/faithzzf/article/details/77009777
2. https://www.cnblogs.com/alantu2018/p/8465894.html