题解
思路
代码
class Solution:
### 0129 找规律(24 ms,14.7 MB)
def rotate(self, matrix: List[List[int]]) -> None:
"""
Do not return anything, modify matrix in-place instead.
"""
n = len(matrix)
# 先水平翻转(也可以先沿对角线翻转,再左右翻转)
for i in range(n // 2):
for j in range(n):
matrix[i][j], matrix[n-i-1][j] = matrix[n-i-1][j], matrix[i][j]
# 再沿对角线翻转
for i in range(n):
for j in range(i):
matrix[i][j], matrix[j][i] = matrix[j][i], matrix[i][j]
# 法二
def rotate(self, matrix: List[List[int]]) -> None:
"""
Do not return anything, modify matrix in-place instead.
"""
for i in range(len(matrix)):
for j in range(i, len(matrix)):
matrix[i][j], matrix[j][i] = matrix[j][i], matrix[i][j]
# 在交换
for i in range(len(matrix)):
matrix[i] = matrix[i][::-1]
旋转一维数组
#
# 旋转数组
# @param n int整型 数组长度
# @param m int整型 右移距离
# @param a int整型一维数组 给定数组
# @return int整型一维数组
#
class Solution:
def solve(self , n , m , a ):
# write code here
### 1
m %= n
for i in range(n // 2): # 先整体旋转一次
a[i], a[n-1-i] = a[n-1-i], a[i]
for i in range(m // 2): # 再旋转前m个
a[i], a[m-1-i] = a[m-1-i], a[i]
for i in range((n - m) // 2): # 最后旋转后n-m个
a[m+i], a[n-1-i] = a[n-1-i], a[m+i] # m+i表示旋转后面的
return a
### 2
m %= n
return a[-m:] + a[:-m]
189. 旋转数组
class Solution:
def rotate(self, A: List[int], k: int) -> None:
def reverse(i, j):
while i < j:
A[i], A[j] = A[j], A[i]
i += 1
j -= 1
n = len(A)
k %= n
reverse(0, n - 1) # 反转整个字符串
reverse(0, k - 1) # 反转区间为前k的子串
reverse(k, n - 1) # 反转区间为k到末尾的子串