[LeetCode] 2236. Root Equals Sum of Children
Python # Definition for a binary tree node. # class TreeNode: # def __init__(self, val=0, left=None, right=None): # self.val = val # self...
최근 포스트
[LeetCode] 1929. Concatenation of Array
Python class Solution: def getConcatenation(self, nums: List[int]) -> List[int]: return nums + nums
[LeetCode] 1920. Build Array from Permutation
Python class Solution: def buildArray(self, nums: List[int]) -> List[int]: answer = [] for i in nums: answer.append(nums[i...
[LeetCode] 2235. Add Two Integers
Python class Solution: def sum(self, num1: int, num2: int) -> int: return num1 + num2
[LeetCode] 1480. Running Sum of 1d Array
Python class Solution: def runningSum(self, nums: List[int]) -> List[int]: answer = [] for i in range(len(nums)): answer.a...