判断矩阵经轮转后是否一致1

题目描述

题目讲解

具体流程

代码

c++
python
java
class Solution:
    def findRotation(self, mat: List[List[int]], target: List[List[int]]) -> bool:
        for _ in range(4):
            if mat == target:
                return True
            mat = self.rotate(mat)
        return False
    def rotate(self, mat:List[List[int]])->List[List[int]]:
        n = len(mat)
        # 上下翻转
        mat.reverse()
        # 转置: 行变列，列变行.
        # 如果从 j = 0 开始，就会把每对元素交换两次，等于没交换.
        for i in range(n):
            for j in range(i+1,n):
                mat[i][j], mat[j][i] = mat[j][i], mat[i][j]
        return mat

链接

  1. 判断矩阵经轮转后是否一致https://leetcode.cn/problems/determine-whether-matrix-can-be-obtained-by-rotation/ ↩︎