-
Notifications
You must be signed in to change notification settings - Fork 521
/
Copy path05. Reshape the Matrix.cpp
69 lines (54 loc) · 1.79 KB
/
05. Reshape the Matrix.cpp
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
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
/*
Reshape the Matrix
==================
In MATLAB, there is a handy function called reshape which can reshape an m x n matrix into a new one with a different size r x c keeping its original data.
You are given an m x n matrix mat and two integers r and c representing the row number and column number of the wanted reshaped matrix.
The reshaped matrix should be filled with all the elements of the original matrix in the same row-traversing order as they were.
If the reshape operation with given parameters is possible and legal, output the new reshaped matrix; Otherwise, output the original matrix.
Example 1:
Input: mat = [[1,2],[3,4]], r = 1, c = 4
Output: [[1,2,3,4]]
Example 2:
Input: mat = [[1,2],[3,4]], r = 2, c = 4
Output: [[1,2],[3,4]]
Constraints:
m == mat.length
n == mat[i].length
1 <= m, n <= 100
-1000 <= mat[i][j] <= 1000
1 <= r, c <= 300
Hint #1
Do you know how 2d matrix is stored in 1d memory? Try to map 2-dimensions into one.
Hint #2
M[i][j]=M[n*i+j] , where n is the number of cols. This is the one way of converting 2-d indices into one 1-d index. Now, how will you convert 1-d index into 2-d indices?
Hint #3
Try to use division and modulus to convert 1-d index into 2-d indices.
Hint #4
M[i] => M[i/n][n%i] Will it result in right mapping? Take some example and check this formula.
*/
class Solution
{
public:
vector<vector<int>> matrixReshape(vector<vector<int>> &A, int r, int c)
{
int n = A.size(), m = A[0].size();
if (n * m != r * c)
return A;
vector<vector<int>> B(r, vector<int>(c, 0));
int bi = 0, bj = 0;
for (int ai = 0; ai < n; ++ai)
{
for (int aj = 0; aj < m; ++aj)
{
B[bi][bj] = A[ai][aj];
bj++;
if (bj == c)
{
bi++;
bj = 0;
}
}
}
return B;
}
};