| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 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
- 43. Multiply Strings
- iterator
- Python Code
- Protocol
- shiba
- 파이썬
- 밴픽
- Python
- Generator
- 컴퓨터의 구조
- t1
- 시바견
- Python Implementation
- 109. Convert Sorted List to Binary Search Tree
- data science
- 운영체제
- LeetCode
- Substring with Concatenation of All Words
- concurrency
- kaggle
- Convert Sorted List to Binary Search Tree
- Class
- attribute
- Regular Expression
- 30. Substring with Concatenation of All Words
- 715. Range Module
- 315. Count of Smaller Numbers After Self
- DWG
- 프로그래머스
- Decorator
Archives
- Today
- Total
목록Valid Sudoku (1)
Scribbling
36. Valid Sudoku
class Solution: def isValidSudoku(self, board: List[List[str]]) -> bool: for i in range(9): for j in range(9): if board[i][j] != '.': # 가로 for k in range(9): if k == j: continue if board[i][j] == board[i][k]: return False # 세로 for k in range(9): if k == i: continue if board[i][j] == board[k][j]: return False # 사각형 start_y = i // 3 * 3 start_x = j // 3 * 3 for y in range(start_y, start_y+3): for ..
Computer Science/Coding Test
2021. 9. 6. 16:37