LeeCode 48 旋转数组 输入输出，二维数组初始化

#include<iostream>
using namespace std;
#include<vector>
#include<algorithm>

class Solution {
public:
    static void rotate(vector<vector<int>>& matrix) {
        int m = matrix.size();
        if (m == 0) return;
        int n = matrix[0].size();
        reverse(matrix.begin(), matrix.end());
        for (int i = 0; i < m; i++)
        {
            for (int j = i+1; j < n; j++)
            {
                swap(matrix[i][j], matrix[j][i]);
            }
        }
    }
};
int main()
{
    int m, n;
    cin >> m >> n;

	/*vector<vector<int>> matrix;
    vector<int> vec;
    int x;
    for (int i = 0; i < m; i++) //二维数组初始化
    {
        vec.clear();            //清空
        for (int j = 0; j < n; j++)
        {
            cin >> x;
            vec.push_back(x);
        }
        matrix.push_back(vec);
    }*/

    vector<vector<int>> matrix(m, vector<int>(n));
    int x;
    for (int i = 0; i < m; i++)
    {
        for (int j = 0; j < n; j++)
        {
            cin >> x;
            matrix[i][j] = x;
        }
    }
    Solution::rotate(matrix);
    for (int i = 0; i < m; i++)
    {

        for (int j = 0; j < n; j++)
        {
            cout << matrix[i][j];
        }
    }
    return 0;

}