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

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

    矩形变换,比如2行2列变成1行4列,某些情况下无法变换

    C++(58ms):

     1 class Solution {
     2 public:
     3     vector<vector<int>> matrixReshape(vector<vector<int>>& nums, int r, int c) {
     4         int m = nums.size() ;
     5         int n = nums[0].size();
     6         if (m*n != r*c)
     7             return nums ;
     8         vector<vector<int>> res(r,vector<int>(c,0)) ;
     9         for (int i = 0; i < m*n;i++ ){
    10                res[i/c][i%c] = nums[i/n][i%n] ;
    11 
    12         }
    13         return res ;
    14     }
    15 };

    C++(55ms):

     1 class Solution {
     2 public:
     3     vector<vector<int>> matrixReshape(vector<vector<int>>& nums, int r, int c) {
     4         int m = nums.size() ;
     5         int n = nums[0].size();
     6         if (m*n != r*c)
     7             return nums ;
     8         vector<vector<int>> res(r,vector<int>(c,0)) ;
     9         for (int i = 0; i < m;i++ ){
    10            for (int j = 0; j < n;j++ ){
    11                int k = i * n + j ;
    12                res[k/c][k%c] = nums[i][j] ;
    13            }  
    14         }
    15         return res ;
    16     }
    17 };
  • 相关阅读:
    使用fiddler2抓取手机发出的请求信息
    HTML转义字符集合
    spm3安装和使用
    JSP
    Servlet
    Struts2
    java多线程-消费者和生产者模式
    java异常处理机制(try-catch-finally)
    java内部类
    java上转型和下转型(对象的多态性)
  • 原文地址:https://www.cnblogs.com/mengchunchen/p/7137933.html
Copyright © 2011-2022 走看看