forked from shuboc/LeetCode-2
-
Notifications
You must be signed in to change notification settings - Fork 0
/
reshape-the-matrix.py
63 lines (60 loc) · 1.75 KB
/
reshape-the-matrix.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
# Time: O(m * n)
# Space: O(m * n)
# 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.
class Solution(object):
def matrixReshape(self, nums, r, c):
"""
:type nums: List[List[int]]
:type r: int
:type c: int
:rtype: List[List[int]]
"""
if not nums or \
r*c != len(nums) * len(nums[0]):
return nums
result = [[0 for _ in xrange(c)] for _ in xrange(r)]
count = 0
for i in xrange(len(nums)):
for j in xrange(len(nums[0])):
result[count/c][count%c] = nums[i][j]
count += 1
return result