로그 남기기

100 - Same Tree 📌 문제 Given the roots of two binary trees p and q, write a function to check if they are the same or not. Two binary trees are considered the same if they are structurally identical, and the nodes have the same value. 📋 코드 class TreeNode: def __init__(self, val=0, left=None, right=None): self.val = val self.left = left self.right = right class Solution: def isSameTree(self, p: Tre..

11 - Container With Most Water 📌 문제 Given n non-negative integers a1, a2, …, an , where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of the line i is at (i, ai) and (i, 0). Find two lines, which, together with the x-axis forms a container, such that the container contains the most water. 📋 코드 class Solution: def maxArea(self, height: List[..

78 - Subsets 📌 문제 Given an integer array nums of unique elements, return all possible subsets (the power set). The solution set must not contain duplicate subsets. Return the solution in any order. 📋 코드 from itertools import combinations class Solution: def subsets(self, nums: List[int]) -> List[List[int]]: result = [] for i in range(len(nums)+1): comb = list(combinations(nums, i)) for c in comb..

17 - Letter Combinations of a Phone Number 📌 문제 Given a string containing digits from 2-9 inclusive, return all possible letter combinations that the number could represent. Return the answer in any order. A mapping of digit to letters (just like on the telephone buttons) is given below. Note that 1 does not map to any letters. 📋 코드 from itertools import product class Solution: def letterCombina..