| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 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
- 파이썬
- Convert Sorted List to Binary Search Tree
- Python Code
- 밴픽
- Class
- attribute
- 30. Substring with Concatenation of All Words
- Python Implementation
- LeetCode
- Decorator
- 시바견
- kaggle
- 컴퓨터의 구조
- DWG
- 109. Convert Sorted List to Binary Search Tree
- Protocol
- Generator
- Substring with Concatenation of All Words
- Python
- 315. Count of Smaller Numbers After Self
- Regular Expression
- 프로그래머스
- t1
- 운영체제
- concurrency
- 715. Range Module
- 43. Multiply Strings
- iterator
- data science
- shiba
Archives
- Today
- Total
목록Subsets (1)
Scribbling
LeetCode: 78. Subsets
class Solution: def subsets(self, nums: List[int]) -> List[List[int]]: self.ret = [] self.helper(nums, []) return self.ret def helper(self, nums, path): self.ret.append(path) if not nums: return for i, num in enumerate(nums): self.helper(nums[i+1:], path+[num])
Computer Science/Coding Test
2021. 10. 1. 22:01