leetcode: Array 48. Rotate Image

题目

You are given an n x n 2D matrix representing an image.

Rotate the image by 90 degrees (clockwise).

Note:

You have to rotate the image in-place, which means you have to modify the input 2D matrix directly. DO NOT allocate another 2D matrix and do the rotation.

Example 1:

Given input matrix = 
[
  [1,2,3],
  [4,5,6],
  [7,8,9]
],

rotate the input matrix in-place such that it becomes:
[
  [7,4,1],
  [8,5,2],
  [9,6,3]
]

Example 2:

Given input matrix =
[
  [ 5, 1, 9,11],
  [ 2, 4, 8,10],
  [13, 3, 6, 7],
  [15,14,12,16]
], 

rotate the input matrix in-place such that it becomes:
[
  [15,13, 2, 5],
  [14, 3, 4, 1],
  [12, 6, 8, 9],
  [16, 7,10,11]
]

思路

本题不许用额外的矩阵空间。所以思路是:

转完外圈 转里圈,一共转 n/2次,每次转的数字个数逐渐减小

答案

class Solution:
    def rotate(self, matrix: List[List[int]]) -> None:
        """
        i 列 <- n-i-1 行 
        j 行 <- j 列
        
        (j,i) = (n-i-1,j)   
        """

        n = len(matrix)
        r = n // 2 + int(n % 2 > 0)
        for r_n in range(r):
            for i in range(n- r_n*2 - 1):
                temp = matrix[r_n][i+r_n]
                matrix[r_n][i+r_n] = matrix[n-i-r_n-1][r_n]
                matrix[n-i-r_n-1][r_n] = matrix[n-r_n-1][n-i-r_n-1]
                matrix[n-r_n-1][n-i-r_n-1] = matrix[i+r_n][n-r_n-1] 
                matrix[i+r_n][n-r_n-1] = temp
        

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值