일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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
- kaggle
- 밴픽
- Decorator
- Class
- 109. Convert Sorted List to Binary Search Tree
- 파이썬
- 43. Multiply Strings
- 715. Range Module
- Protocol
- Regular Expression
- Substring with Concatenation of All Words
- DWG
- Generator
- t1
- Python Implementation
- concurrency
- 운영체제
- Convert Sorted List to Binary Search Tree
- attribute
- 시바견
- 315. Count of Smaller Numbers After Self
- iterator
- 프로그래머스
- LeetCode
- shiba
- Python
- 컴퓨터의 구조
- 30. Substring with Concatenation of All Words
- Python Code
- data science
Archives
- Today
- Total
목록Spiral Matrix II (1)
Scribbling
LeetCode: 59. Spiral Matrix II
class Solution: def generateMatrix(self, n: int) -> List[List[int]]: ret = [[0] * n for _ in range(n)] num = 1 count = 0 y, x = count, count while y < n: y, x = count, count i, j = y, x for j in range(x, n): ret[i][j] = num num += 1 for i in range(y+1, n): ret[i][j] = num num += 1 for j in range(n-2, x-1, -1): ret[i][j] = num num += 1 for i in range(n-2, y, -1): ret[i][j] = num num += 1 count +=..
Computer Science/Coding Test
2021. 9. 24. 14:58