| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 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
- shiba
- Generator
- attribute
- Decorator
- Python Code
- kaggle
- Convert Sorted List to Binary Search Tree
- 운영체제
- Class
- iterator
- 715. Range Module
- 프로그래머스
- 315. Count of Smaller Numbers After Self
- 시바견
- 밴픽
- t1
- LeetCode
- Python Implementation
- 파이썬
- 30. Substring with Concatenation of All Words
- data science
- 43. Multiply Strings
- Regular Expression
- Substring with Concatenation of All Words
- 컴퓨터의 구조
- DWG
- concurrency
- Protocol
Archives
- Today
- Total
목록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