zoukankan      html  css  js  c++  java
  • [LeetCode] 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 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:

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

    Analyse

    遍历原二维数组依次取出数据放到新数组中,到了新数组的列数就换行

     vector<vector<int>> matrixReshape(vector<vector<int>>& nums, int r, int c)     {
        int row = nums.size();
        int col = nums.at(0).size();
    
        if (row * col != r * c)
        {
            return nums;
        }
    
        vector<vector<int>> result;
        vector<int> tmp;
    
        for (int i = 0; i < row; i++)
        {
            for (int j = 0; j < col; j++)
            {
                if (tmp.size() + 1 < c)
                {
                    tmp.push_back(nums.at(i).at(j));
                }
                else
                {
                    tmp.push_back(nums.at(i).at(j));
                    result.push_back(tmp);
                    tmp.clear();
                }
            }
        }
    
        return result;
    }
    

    看看LeetCode上其他代码,利用/%算出reshape后的下标,简洁明了,厉害

    vector<vector<int>> matrixReshape(vector<vector<int>>& nums, int r, int c) {
        if (nums.empty() || nums[0].empty()) {
            return nums;
        }
    
        size_t rows = nums.size();
        size_t columns = nums[0].size();
        size_t input_size = rows * columns;
        size_t traversing_size = r * c;
    
        if (traversing_size > input_size) {
            // illegal
            return nums;
        }
    
        vector<vector<int>> traversing(r, vector<int>(c, 0));
    
        //填满新的二维数组
        for (int k = 0; k < r; k++) {
            for (int m = 0; m < c; m++) {
                // 算出在原数组中的下标
                int linear_address = k * c + m;
                int i = linear_address / columns;
                int j = linear_address % columns;
                traversing[k][m] = nums[i][j];
            }
        }
    
        return traversing;
    }
    
  • 相关阅读:
    VisualStudio 2012中的单元测试
    基于.Net 写我自己的Ajax后台框架AjaxFramework
    MongoDB的真正性能实战百万用户
    基于MMSeg算法的中文分词类库
    Visual Studio 2012的新插件Code Digger (类似Pex)
    Visual Studio 2010 单元测试之一普通单元测试
    Django系列教程:一、Django的安装和入门
    Cocos2dx 入门调研总结
    教程:建立自己的私有云
    如何让你的作业在Hadoop集群中真正实现分布式运行
  • 原文地址:https://www.cnblogs.com/arcsinw/p/9498628.html
Copyright © 2011-2022 走看看