1
class Solution {
2
public:
3
vector<vector<int>> matrixReshape(vector<vector<int>> &mat, int r, int c) {
4
int m = mat.size(), n = mat[0].size();
5
vector<vector<int>> v(r, vector<int>(c));
6
queue<int> q;
7
if (m * n == r * c) {
8
for (int i = 0; i < m; i++) {
9
for (int j = 0; j < n; j++) {
10
q.push(mat[i][j]);
11
}
12
}
13
for (int i = 0; i < r; i++) {
14
for (int j = 0; j < c; j++) {
15
v[i][j] = q.front();
16
q.pop();
17
}
18
}
19
return v;
20
}
21
return mat;
22
}
23
};

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0