【LeetCode】【数组】题号：56，重塑矩阵

every blog every motto: You will never know unless you try

0. 前言

hold on

1. 正文

1.2 题解

class Solution:
    def matrixReshape(self, mat: List[List[int]], new_R: int, new_C: int) -> List[List[int]]:
        row = len(mat)  # 原数组的行
        col = len(mat[0])  # 原数组的列

        if new_R * new_C == row * col:

            nums = [[0 for _ in range(new_C)] for _ in range(new_R)]

            i = 0
            j = 0
            # 遍历原数组中的每个值，按行搜索
            for r in range(row):
                for c in range(col):
                    nums[i][j] = mat[r][c]

                    # 新数组中的一行
                    if j < new_C - 1:
                        j += 1
                    # 换下一行
                    else:
                        i += 1
                        j = 0 
            return nums
            
        else:
            return mat

1.3