问题描述:
输入一个n*n字符矩阵,把它左转90°后输出
发现规律:同一行的行号变成列号,列好颠倒顺序变成行号
# include<iostream>
# include<stdio.h>
# include<string.h>
# define MAXN 100+10
char s[MAXN][MAXN];
char ss[MAXN][MAXN];
using namespace std;
int main()
{
int n;
scanf("%d",&n);
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)scanf("%d",&s[i][j]);
//关键代码👇
for (int i = 0; i < n; i++)
{
for (int j = n-1; j >= 0; j--)
{
ss[j][i]=s[i][n-1-j];
}
}
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
printf("%d ",ss[i][j]);
}
printf("\n");
}
return 0;
}