// C++ 程序查找矩阵的转置
#include <bits/stdc++.h>
using namespace std;
#define N 4
 
// 此函数将 A [ ] [ ] 的转置存储在 B [ ] [ ] 中
void transpose(int A[][N],
               int B[][N])
{
    int i, j;
    for (i = 0; i < N; i++)
        for (j = 0; j < N; j++)
            B[i][j] = A[j][i];
}
 
// 主函数
int main()
{
    int A[N][N] = {{1, 1, 1, 1},
                   {2, 2, 2, 2},
                   {3, 3, 3, 3},
                   {4, 4, 4, 4}};
 
    int B[N][N], i, j;
 
    transpose(A, B);
 
    cout << "Result matrix is ";
    for (i = 0; i < N; i++)
    {
        for (j = 0; j < N; j++)
           cout << " " << B[i][j];
        cout <<"";
    }
    return 0;
}  

结果矩阵是
1 2 3 4
1 2 3 4
1 2 3 4
1 2 3 **4**

// C++程序查找矩阵的转置
#include <bits/stdc++.h>
using namespace std;
#define M 3
#define N 4
 
// 此函数将 A [ ] [ ] 的转置存储在 B [ ] [ ] 中
void transpose(int A[][N], int B[][M])
{
    int i, j;
    for(i = 0; i < N; i++)
        for(j = 0; j < M; j++)
            B[i][j] = A[j][i];
}
 
// 主函数
int main()
{
    int A[M][N] = {{1, 1, 1, 1},
                   {2, 2, 2, 2},
                   {3, 3, 3, 3}};
 
    // 注意 B [ ] [ ] 的维度
    int B[N][M], i, j;
 
    transpose(A, B);
 
   cout << "Result matrix is ";
    for(i = 0; i < N; i++)
    {
        for(j = 0; j < M; j++)
            cout << " " << B[i][j];

        cout << "";
    }
    return 0;
}  

结果矩阵是
1 2 3 
1 2 3 
1 2 3 
1 2 3

// C++程序实现
// 上面的方法
#include <bits/stdc++.h>
using namespace std;
 
#define N 4
 
// 将 A [ ][ ] 转换为其转置
void transpose(int A[][N])
{
    for (int i = 0; i < N; i++)
        for (int j = i+1; j < N; j++)
            swap(A[i][j], A[j][i]);
}
 
// 主函数
int main()
{
    int A[N][N] = {{1, 1, 1, 1},
                   {2, 2, 2, 2},
                   {3, 3, 3, 3},
                   {4, 4, 4, 4}};
 
    transpose(A);
 
    printf("Modified matrix is ");
    for (int i = 0; i < N; i++)
    {
        for (int j = 0; j < N; j++)
           printf("%d ", A[i][j]);
        printf("");
    }
 
    return 0;
}  

Modified matrix is
1 2 3 4
1 2 3 4
1 2 3 4
1 2 3 4