Notice
Recent Posts
Recent Comments
Link
| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 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
- hash table
- leetcode
- 중간
- matrix
- Medium
- 이진트리
- sorting
- two pointers
- backtracking
- Depth-first Search
- 미디움
- list
- recursive
- 재귀
- dfs
- string
- Array
- easy
- binary search
- linked list
- HashTable
- 쉬움
- 리트코드
- tree
- binary tree
- 문자열
- Binary
- math
- Python
- DP
Archives
- Today
- Total
목록leetcode38 (1)
부부의 코딩 성장 일기
LeetCode 38(Count and Say, Python)
1. 문제 링크 https://leetcode.com/problems/count-and-say Count and Say - LeetCode Can you solve this real interview question? Count and Say - The count-and-say sequence is a sequence of digit strings defined by the recursive formula: * countAndSay(1) = "1" * countAndSay(n) is the way you would "say" the digit string from countAndSay(n-1 leetcode.com 2. 문제 설명 count-and-say sequence는 재귀적인 공식에 의해 정의된 숫..
Algorithm/LeetCode
2023. 12. 29. 19:00