[LeetCode] 1365. How Many Numbers Are Smaller Than the Current Number
Python class Solution: def smallerNumbersThanCurrent(self, nums: List[int]) -> List[int]: answer = [] for num in nums: tem...
최근 포스트
[LeetCode] 1281. Subtract the Product and Sum of Digits of an Integer
Python class Solution: def subtractProductAndSum(self, n: int) -> int: temp = list(map(int, ' '.join(str(n)).split())) product_of_digi...
[LeetCode] 105. Construct Binary Tree from Preorder and Inorder Traversal
Python ~~~python 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 ...
[LeetCode] 102. Binary Tree Level Order Traversal
Python # Definition for a binary tree node. # class TreeNode: # def __init__(self, val=0, left=None, right=None): # self.val = val # self...
[LeetCode] 6. Zigzag Conversion
Python ~~~python class Solution: def convert(self, s: str, numRows: int) -> str: if len(s) <= numRows or numRows < 2: return...