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




    这道题描述的需求是:
    需要我们重构一个矩阵
    提供给我们某一个矩阵,然后再给我们两个整数r和c 表示希望我们重构成r 行 c 列 的矩阵
    如果不能重构返回原行列式

    思想就是:
    首先要判断一下 如果r*c等于给定矩阵的元素数量,那就能重构
      重构 把所有元素取出来 再按照要求生成新的矩阵就可以了

    我的python代码:
     1 class Solution(object):
     2     def matrixReshape(self, nums, r, c):
     3         """
     4         :type nums: List[List[int]]
     5         :type r: int
     6         :type c: int
     7         :rtype: List[List[int]]
     8         """
     9         if r*c == len(nums)*len(nums[0]):
    10             newList = [ i for j in range(len(nums) ) for i in nums[j]  ]
    11             return  [ [ newList.pop(0) for i in range(c) ] for j in range(r) ]
    12         else:
    13             return nums
    14 
    15 
    16 
    17 if __name__ == '__main__':
    18     s = Solution()
    19     res = s.matrixReshape([[1,2],[3,4]],1,4)
    20     #res = s.matrixReshape([[1, 2], [3, 4]],4,1)
    21     print(res)





  • 相关阅读:
    求一个整数的划分
    HDU 1028 Ignatius and the Princess III
    HDU1215
    博弈论(2)
    阶乘的位数
    母函数详解
    SpragueGrundy FunctionSG函数博弈论(3)
    图的基本操作邻接表类型
    HDU 1536 SG函数应用
    顺序栈的实现
  • 原文地址:https://www.cnblogs.com/Lin-Yi/p/7501832.html
Copyright © 2011-2022 走看看