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

오늘도 무지성 스텍 쌓아버린 나의 코드 from copy import deepcopy class Solution: def solveNQueens(self, n: int) -> List[List[str]]: ret = [] board = [['.'] * n for _ in range(n)] self.solver(n, board, 0, ret) return ret def solver(self, n, board, num_Q, ret): if num_Q == n: ret_board = [] for i in range(n): temp = list(board[i]) for j in range(len(temp)): if temp[j] != 'Q': temp[j] = '.' ret_board.append(''.join..
Computer Science/Coding Test
2021. 9. 14. 22:40