LeetCode 566. Reshape the Matrix

最新推荐文章于 2021-05-22 20:29:00 发布

HelloSilicat

最新推荐文章于 2021-05-22 20:29:00 发布

阅读量147

点赞数

分类专栏： Leetcode 文章标签： leetcode c++

本文链接：https://blog.csdn.net/peisir/article/details/74783791

版权

Leetcode 专栏收录该内容

65 篇文章 0 订阅

订阅专栏

566. Reshape the Matrix

Description

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

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.

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.

Note:
1. The height and width of the given matrix is in range [1, 100].
2. The given r and c are all positive.

Solution

//最初用c写，但是LeetCode要返回太多东西，有些不明白某个返回值的含义，索性用了C++
//题目意思就是 将一个矩阵按照层遍历填入一个新的指定大小的新矩阵中，如果size不一样，那么返回原矩阵
//我的做法很暴力，一维数组存了所有的数，再填入新的二维数组中，代码如下

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

//Solution里面有优化 我的填入过程的，也一并附上。

for (int i = 0; i < r * c; i++) 
    rnt[i / c][i % c] = nums[i / n][i % n];

//这种简洁版的二维数组遍历方式值得学习。（虽说之前写过，但是忘记了/(((φ(◎ロ◎;)φ)))）