<easy>LeetCode Problem -- 566. Reshape the Matrix

• 描述：In MATLAB, there is a very useful function called ‘reshape’, which can reshape a matrix into a new one with different size but keep its original data.

You’re given a matrix represented by a two-dimensional array, and two positive integers r and c representing the row number and column number of the wanted reshaped matrix, respectively.

The reshaped matrix need to 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:
nums =
[[1,2],
[3,4]]
r = 1, c = 4
Output:
[[1,2,3,4]]
Explanation:
The row-traversing of nums is [1,2,3,4]. The new reshaped matrix is a 1 * 4 matrix, fill it row by row by using the previous list.

Example 2:

Input:
nums =
[[1,2],
[3,4]]
r = 2, c = 4
Output:
[[1,2],
[3,4]]
Explanation:
There is no way to reshape a 2 * 2 matrix to a 2 * 4 matrix. So output the original matrix.

• 分析：有使用matlb和python的同学会用到一个很有用的函数reshape函数，利用这个函数可以将数组的大小进行重新设置。这道题要求对一个数组进行重新设置大小，给出了reshape之后的行数和列数r和c。
• 思路一：(二维数组)利用循环解决。

class Solution {
public:
    vector<vector<int>> matrixReshape(vector<vector<int>>& nums, int r, int c) {
        int m = nums.size();
        int n = nums[0].size();
        if (m * n != r * c) return nums;
        vector<vector<int>> res(r, vector<int>(c, 0));
        for (int i = 0, temp = 0; i < nums.size(); i++) {
            for (int j = 0; j < nums[0].size(); j++, temp++) {
                res[temp / c][temp % c] = nums[i][j];
            }
        }
        return res;
    }
};

• 思路二：利用一维数组思想解决。

class Solution {
public:
    vector<vector<int>> matrixReshape(vector<vector<int>>& nums, int r, int c) {
        int m = nums.size();
        int n = nums[0].size();
        if (m * n != r * c) return nums;
        vector<vector<int>> res(r, vector<int>(c, 0));
        for (int i = 0; i < n * m; i++) {
            res[i / c][i % c] = nums[i / n][i % n];
        }
        return res;
    }
};

• 思考：在需要对数组形状操作之时，将二维数组看作一维数组操作起来更为简单，也可以提高效率。