[LeetCode] 199. Binary Tree Right Side View
Python # Definition for a binary tree node. # class TreeNode: # def __init__(self, val=0, left=None, right=None): # self.val = val # self...
최근 포스트
[LeetCode] 28. Implement strStr()
Python class Solution: def strStr(self, haystack: str, needle: str) -> int: if len(needle) == 0 : return 0 else : ...
[LeetCode] 67. Add Binary
Python class Solution: def addBinary(self, a: str, b: str) -> str: return format(int(a, 2) + int(b, 2), 'b')
[LeetCode] 12. Integer to Roman
Python class Solution: def intToRoman(self, num: int) -> str: number = [1, 4, 5, 9, 10, 40, 50, 90, 100, 400, 500, 900, 1000] symbol =...
[LeetCode] 27. Remove Element
Python class Solution: def removeElement(self, nums: List[int], val: int) -> int: while nums.count(val): nums.remove(val) ...