c_867_Transpose_Matrix

Posted on | In |

//
// Created by Mr.Hu on 2018/8/6.
//
// leetcode 867 transpose matrix
//
// 题目要求对给定的矩阵求转置
// 思路比较简单，第i行第j列的值，变为第j行第i列的值
// i行j列的矩阵的转置为j行i列
// 对应位置赋值即可
//

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
#include <iostream>
#include <vector>
using namespace std;

class Solution {
public:
    vector<vector<int>> transpose(vector<vector<int>> &A) {
        int row = A.size();
        int col = A[0].size();
        vector<vector<int>> ts(col, vector<int>(row));
        for (int i = 0; i < row; ++i) {
            for (int j = 0; j < col; ++j) {
                ts[j][i] = A[i][j];
            }
        }
        return ts;
    }
};

int main() {
    vector<vector<int>> A;
    vector<int> x;
    x.emplace_back(1);
    x.emplace_back(2);
    x.emplace_back(3);
    A.emplace_back(x);
    x.clear();
    x.emplace_back(4);
    x.emplace_back(5);
    x.emplace_back(6);
    A.emplace_back(x);
    Solution solution;
    vector<vector<int>> result = solution.transpose(A);
    for (auto n:result) {
        for (auto m:n) {
            cout << m << " ";
        }
        cout << endl;
    }
}