본문 바로가기

728x90

리트코드 파이썬 솔루션

문돌이 존버/프로그래밍 스터디 2021. 10. 1.
(leetcode 문제 풀이) Balanced Binary Tree Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is defined as: a binary tree in which the left and right subtrees of every node differ in height by no more than 1. Constraints: The number of nodes in the tree is in the range [0, 5000].-104 1: return -1 return max(left, right) + 1 def isBalanced(self, root: Optional[TreeNode]) -> bool: retu..
문돌이 존버/프로그래밍 스터디 2021. 9. 30.
(leetcode 문제 풀이) Longest Common Prefix Write a function to find the longest common prefix string amongst an array of strings. If there is no common prefix, return an empty string "". Example 1: Input: strs = ["flower","flow","flight"] Output: "fl" Example 2: Input: strs = ["dog","racecar","car"] Output: "" Explanation: There is no common prefix among the input strings. Constraints: - 1 str: if len(strs) == 0: return return self.longe..
문돌이 존버/프로그래밍 스터디 2021. 9. 26.
(leetcode 문제 풀이) Add Binary Given two binary strings a and b, return their sum as a binary string. Example 1: Input: a = "11", b = "1" Output: "100" Example 2: Input: a = "1010", b = "1011" Output: "10101" Constraints: - 1 len(b): for _ in range(len(a) - len(b)): b = '0' + b else: for _ in range(len(b) - len(a)): a = '0' + a std_len = max(len(a), len(b)) # 맨 뒤의 원소를 먼저 비교해서 높임 여부 확인 if a[-1] == '1' and b[-1] == '1': carry =..

728x90

티스토리툴바