C语言编程旋转矩阵,c – 旋转矩阵n次

当我陷入困境时,我正在解决HackerRank上的问题.

问题陈述

You are given a 2D matrix, a, of dimension MxN and a positive integer R. You have to rotate the matrix R times and print the resultant matrix. Rotation should be in anti-clockwise direction.

4×5矩阵的旋转由下图表示.请注意,在一次旋转中,您必须仅将元素移动一步(请参阅样本测试以获得更清晰).

保证M和N的最小值是偶数.

输入

First line contains three space separated integers, M, N and R, where M is the number of rows, N is number of columns in matrix, and R is the number of times the matrix has to be rotated.

Then M lines follow, where each line contains N space separated positive integers. These M lines represent the matrix.

产量

Print the rotated matrix.

约束

2 <= M, N <= 300

1 <= R <= 10^9

min(M, N) % 2 == 0

1 <= aij <= 108, where i ∈ [1..M] & j ∈ [1..N]'

我试图做的是将圆圈存储在一维数组中.像这样的东西.

while(true)

{

k = 0;

for(int j = left; j <= right; ++j) {temp[k] = a[top][j]; ++k;}

top++;

if(top > down || left > right) break;

for(int i = top; i <= down; ++i) {temp[k] = a[i][right]; ++k;}

right--;

if(top > down || left > right) break;

for(int j = right; j >= left; --j) {temp[k] = a[down][j] ; ++k;}

down--;

if(top > down || left > right) break;

for(int i = down; i >= top; --i) {temp[k] = a[i][left]; ++k;}

left++;

if(top > down || left > right) break;

}

然后我可以通过计算其模数为R的长度来轻松旋转1D矩阵.但是,我如何将其重新放回矩阵形式？再次使用循环可能会导致超时.

请不要提供代码,但只提供建议.我想自己做.

解决方案创建：

#include

using namespace std;

int main() {

int m,n,r;

cin>>m>>n>>r;

int a[300][300];

for(int i = 0 ; i < m ; ++i){

for(int j = 0; j < n ; ++j)

cin>>a[i][j];

}

int left = 0;

int right = n-1;

int top = 0;

int down = m-1;

int tleft = 0;

int tright = n-1;

int ttop = 0;

int tdown = m-1;

int b[300][300];

int k,size;

int temp[1200];

while(true){

k=0;

for(int i = left; i <= right ; ++i)

{

temp[k] = a[top][i];

// cout<

++k;

}

++top;

if(top > down || left > right)

break;

for(int i = top; i <= down ; ++i)

{

temp[k]=a[i][right];

// cout<

++k;

}

--right;

if(top > down || left > right)

break;

for(int i = right; i >= left ; --i)

{

temp[k] = a[down][i];

// cout<

++k;

}

--down;

if(top > down || left > right)

break;

for(int i = down; i >= top ; --i)

{

temp[k] = a[i][left];

// cout<

++k;

}

++left;

if(top > down || left > right)

break;

//________________________________\\

size = k;

k=0;

// cout<

for(int i = tleft; i <= tright ; ++i)

{

b[ttop][i] = temp[(k + (r%size))%size];

// cout<

// int index = (k + (r%size))%size;

// cout<

++k;

}

++ttop;

for(int i = ttop; i <= tdown ; ++i)

{

b[i][tright]=temp[(k + (r%size))%size];

++k;

}

--tright;

for(int i = tright; i >= tleft ; --i)

{

b[tdown][i] = temp[(k + (r%size))%size];

++k;

}

--tdown;

for(int i = tdown; i >= ttop ; --i)

{

b[i][tleft] = temp[(k + (r%size))%size];

++k;

}

++tleft;

}

size=k;

k=0;

if(top != ttop){

for(int i = tleft; i <= tright ; ++i)

{

b[ttop][i] = temp[(k + (r%size))%size];

++k;

}

++ttop;

}

if(right!=tright){

for(int i = ttop; i <= tdown ; ++i)

{

b[i][tright]=temp[(k + (r%size))%size];

++k;

}

--tright;

}

if(down!=tdown){

for(int i = tright; i >= tleft ; --i)

{

b[tdown][i] = temp[(k + (r%size))%size];

++k;

}

--tdown;

}

if(left!=tleft){

for(int i = tdown; i >= ttop ; --i)

{

b[i][tleft] = temp[(k + (r%size))%size];

++k;

}

++tleft;

}

for(int i = 0 ; i < m ;++i){

for(int j = 0 ; j < n ;++j)

cout<

cout<

}

return 0;

}