Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
3 changes: 3 additions & 0 deletions leetcode3/변지협/v4/2305. Fair Distribution of Cookies.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,3 @@
'''
백트래킹 구현 실패
'''
47 changes: 47 additions & 0 deletions leetcode3/변지협/v4/988. Smallest String Starting From Leaf.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,47 @@
'''
1. 아이디어 :
bfs로 모든 leaf 노드 탐색 후, 정렬하여 첫번째 요소를 정답으로 한다.

2. 시간복잡도 :
o(nlogn) (정렬)

3. 자료구조/알고리즘 :
bfs / 완전탐색
'''

from collections import deque

# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, val=0, left=None, right=None):
# self.val = val
# self.left = left
# self.right = right
class Solution:
def smallestFromLeaf(self, root: TreeNode | None) -> str:
dic = {}
alpha = 'abcdefghijklmnopqrstuvwxyz'

for i in range(len(alpha)):
dic[str(i)] = alpha[i]

queue = deque()

queue.append((root, dic[str(root.val)]))
snake = []

while queue:
node,curr= queue.pop()

if node.left is None and node.right is None:
snake.append(curr)

if node.left:
queue.append((node.left,dic[str(node.left.val)]+curr))
if node.right:
queue.append((node.right,dic[str(node.right.val)]+curr))

snake.sort()

return snake[0]

Loading