Leetcode: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.

Note:

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

难度等级:简单

reshape对应的矩阵,这个感觉要注意的其实是怎么定义已知大小的矩阵,算法方面还是很简单的。

class Solution {
public:
    vector<vector<int>> matrixReshape(vector<vector<int>>& nums, int r, int c) {
        if(nums.size()*nums[0].size() != (r*c)) return nums;
        vector<vector<int> > reshapeMatrix(r, vector<int>(c));
        vector<int> vec[c];
        int x = 0, y = 0;
        for(int i = 0 ; i < nums.size(); i++)
        {

            for(int j = 0; j < nums[i].size(); j++)
            {
                if(y<c)
                {
                    reshapeMatrix[x][y++] = nums[i][j];
                }
                else{
                    y = 0;
                    x++;
                    reshapeMatrix[x][y++] = nums[i][j];

                }
            }
        }

        return reshapeMatrix;
    }
};

周六不好好吃饭,直接犯肠炎了,身体是革命的本钱,加强锻炼,好好吃饭O(∩_∩)O哈哈~

猜你喜欢

转载自blog.csdn.net/felaim/article/details/80465848