개행 추가

Author: devyejin

3sum/devyejin.py

@@ -33,4 +33,4 @@ def threeSum(self, nums: List[int]) -> List[List[int]]:
                 else:
                     right -= 1
 
-        return result
+        return result

number-of-1-bits/devyejin.py

@@ -4,4 +4,4 @@ def hammingWeight(self, n: int) -> int:
         while n:
             result += n % 2
             n //= 2
-        return result
+        return result

product-of-array-except-self/devyejin.py

@@ -13,4 +13,4 @@ def productExceptSelf(self, nums):
             result[i] *= right_product
             right_product *= nums[i]
 
-        return result
+        return result

valid-palindrome/devyejin.py

@@ -4,4 +4,3 @@ def isPalindrome(self, s: str) -> bool:
         s = s.replace(" ", "")
         changed_s = [c.lower() for c in s if c.isalnum()]
         return changed_s == changed_s[::-1]
-

validate-binary-search-tree/devyejin.py

@@ -48,4 +48,4 @@ def inorder(node):
 
             return inorder(node.right)
 
-        return inorder(root)
+        return inorder(root)