leetcode-----矩阵向右旋转90°

题目:

思路其实就是记住:向右旋转就是:先把矩阵进行转置,再没行倒序。

额外,向左旋转则是把矩阵转置就可以了。

class Solution:
    def rotate(self, matrix):
        """
        :type matrix: List[List[int]]
        :rtype: void Do not return anything, modify matrix in-place instead.
        """
        n = len(matrix[0])
        # transpose matrix
        for i in range(n):
            for j in range(i, n):
                matrix[j][i], matrix[i][j] = matrix[i][j], matrix[j][i]
                # reverse each row
        for i in range(n):
            matrix[i].reverse()
        return matrix

ss = Solution()

matrix = [
  [1,2,3],
  [4,5,6],
  [7,8,9]
]
print(ss.rotate(matrix))
'''
[[7, 4, 1], 
[8, 5, 2], 
[9, 6, 3]]
'''
发布了278 篇原创文章 · 获赞 470 · 访问量 82万+

猜你喜欢

转载自blog.csdn.net/u014453898/article/details/104978483