题解 | 矩阵转置
矩阵转置
https://www.nowcoder.com/practice/351b3d03e410496ab5a407b7ca3fd841
#include <stdio.h>
int main() {
int m, n;
scanf("%d %d", &m, &n);
int arr[10][10] = { 0 };
int tmp[10][10] = { 0 };
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
scanf("%d", &arr[i][j]);
}
}
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
tmp[j][i] = arr[i][j];
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
printf("%d ", tmp[i][j]);
}
printf("\n");//每行结束换行
}
return 0;
}
算法学习篇:新手入门130 文章被收录于专栏
算法学习篇:新手入门130