[LC] 240818 fix line break lint

Author: HaJunYoo

contains-duplicate/hajunyoo.py

@@ -4,4 +4,4 @@ def containsDuplicate(self, nums: List[int]) -> bool:
         string_len = len(nums)
         set_len = len(set(nums))
 
-        return string_len != set_len
+        return string_len != set_len

kth-smallest-element-in-a-bst/hajunyoo.py

@@ -10,7 +10,6 @@
 class Solution:
     # Time complexity: O(n)
     def kthSmallest(self, root: Optional[TreeNode], k: int) -> int:
-
         self.count = 0
         self.result = 0
 
@@ -28,4 +27,4 @@ def dfs(node):
             dfs(node.right)
 
         dfs(root)
-        return self.result
+        return self.result

number-of-1-bits/hajunyoo.py

@@ -1,10 +1,9 @@
 class Solution:
     # Time complexity: O(log n)
     def hammingWeight(self, n: int) -> int:
-        n = int(n)
         cnt = 0
         while n > 0:
             if n % 2 == 1:
                 cnt += 1
             n = n // 2
-        return cnt
+        return cnt

palindromic-substrings/hajunyoo.py

@@ -16,4 +16,4 @@ def two_pointer_expand(left, right):
             # 2, 4, 6 ...
             two_pointer_expand(i, i + 1)
 
-        return self.count
+        return self.count

top-k-frequent-elements/hajunyoo.py

@@ -17,4 +17,4 @@ def topKFrequent(self, nums: List[int], k: int) -> List[int]:
         count_list.sort(key=lambda x: x[1], reverse=True)
         answer = [a for a, b in count_list[:k]]
 
-        return answer
+        return answer