| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 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
- Protocol
- kaggle
- 운영체제
- shiba
- 109. Convert Sorted List to Binary Search Tree
- iterator
- Regular Expression
- Class
- Convert Sorted List to Binary Search Tree
- 30. Substring with Concatenation of All Words
- t1
- 시바견
- Python Code
- DWG
- Substring with Concatenation of All Words
- data science
- Decorator
- Python Implementation
- concurrency
- Python
- 315. Count of Smaller Numbers After Self
- attribute
- 파이썬
- 컴퓨터의 구조
- 715. Range Module
- 프로그래머스
- 밴픽
- 43. Multiply Strings
- Generator
- LeetCode
Archives
- Today
- Total
목록모의고사 (1)
Scribbling
프로그래머스: 모의고사
Generator를 이용한 해법 def solution(answers): def gen1(): candidates = [1, 2, 3, 4, 5] while True: for candidate in candidates: yield candidate def gen2(): candidates = [2, 1, 2, 3, 2, 4, 2, 5] while True: for candidate in candidates: yield candidate def gen3(): candidates = [3, 3, 1, 1, 2, 2, 4, 4, 5, 5] while True: for candidate in candidates: yield candidate g1 = gen1() g2 = gen2() g3 = gen3() ans..
Computer Science/Coding Test
2021. 10. 20. 00:50