| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 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 |
Tags
- 109. Convert Sorted List to Binary Search Tree
- Decorator
- data science
- LeetCode
- Python Code
- 파이썬
- Python
- 컴퓨터의 구조
- 프로그래머스
- 715. Range Module
- Regular Expression
- concurrency
- Convert Sorted List to Binary Search Tree
- iterator
- 43. Multiply Strings
- DWG
- kaggle
- 30. Substring with Concatenation of All Words
- 시바견
- attribute
- Protocol
- Generator
- Python Implementation
- 밴픽
- shiba
- 315. Count of Smaller Numbers After Self
- 운영체제
- t1
- Class
- Substring with Concatenation of All Words
Archives
- Today
- Total
목록37. Sudoku Solver (1)
Scribbling
37. Sudoku Solver
class Solution: def solveSudoku(self, board: List[List[str]]) -> None: """ Do not return anything, modify board in-place instead. """ num_left = 0 for i in range(9): for j in range(9): if board[i][j] == '.': num_left += 1 self.solver(board, num_left) def solver(self, board, num_left): if num_left == 0: return True # Search Blank -> (i, j) start_y, start_x = 0, 0 found_flag = False for t in range..
Computer Science/Coding Test
2021. 9. 6. 21:53