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
28 changes: 28 additions & 0 deletions 988. Smallest String Starting From Leaf
Original file line number Diff line number Diff line change
@@ -0,0 +1,28 @@
# 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
from collections import deque

class Solution:
def smallestFromLeaf(self, root: TreeNode | None) -> str:
def ch(node):
return chr(node.val + 97) # 'a': 97

result = []
q = deque([(root, ch(root))])

while q:
node, cur = q.popleft()
if not node.left and not node.right:
result.append(cur)
continue
if node.left:
q.append((node.left, ch(node.left) + cur))
if node.right:
q.append((node.right, ch(node.right) + cur))


return min(result)
11 changes: 11 additions & 0 deletions leetcode3/송주혜/2305. Fair Distribution of Cookies
Original file line number Diff line number Diff line change
@@ -0,0 +1,11 @@
class Solution:
def distributeCookies(self, cookies: list[int], k: int) -> int:
cookies.sort(reverse=True)
result = 10e9

def dfs(idx):


dfs(0)

return result
Loading