| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 1 | 2 | |||||
| 3 | 4 | 5 | 6 | 7 | 8 | 9 |
| 10 | 11 | 12 | 13 | 14 | 15 | 16 |
| 17 | 18 | 19 | 20 | 21 | 22 | 23 |
| 24 | 25 | 26 | 27 | 28 | 29 | 30 |
| 31 |
Tags
- 109. Convert Sorted List to Binary Search Tree
- Python Implementation
- t1
- 315. Count of Smaller Numbers After Self
- 프로그래머스
- 30. Substring with Concatenation of All Words
- concurrency
- Class
- Decorator
- 43. Multiply Strings
- 715. Range Module
- Python Code
- 시바견
- 밴픽
- attribute
- LeetCode
- Python
- Convert Sorted List to Binary Search Tree
- 파이썬
- Substring with Concatenation of All Words
- DWG
- Protocol
- Regular Expression
- shiba
- 운영체제
- 컴퓨터의 구조
- kaggle
- iterator
- Generator
- data science
Archives
- Today
- Total
Scribbling
LeetCode: 48. Rotate Image 본문
Rotating a matrix 90 degrees clockwise can be achieved just by transposing + mirror reversing.
class Solution:
def rotate(self, matrix: List[List[int]]) -> None:
"""
Do not return anything, modify matrix in-place instead.
"""
m, n = len(matrix), len(matrix[0])
for i in range(m):
for j in range(i+1, n):
matrix[i][j], matrix[j][i] = matrix[j][i], matrix[i][j]
for i in range(m):
for j in range(n//2):
matrix[i][j], matrix[i][n-j-1] = matrix[i][n-j-1], matrix[i][j]'Computer Science > Coding Test' 카테고리의 다른 글
| 36. Valid Sudoku (0) | 2021.09.06 |
|---|---|
| 44. Wildcard Matching (0) | 2021.09.06 |
| 39. Combination Sum (0) | 2021.09.04 |
| 32. Longest Valid Parentheses (0) | 2021.09.04 |
| LeetCode: 29. Divide Two Integers (0) | 2021.09.02 |