Fix Line Breaking

Author: jinbeom

contains-duplicate/kayden.py

@@ -3,4 +3,5 @@
 class Solution:
     def containsDuplicate(self, nums: List[int]) -> bool:
         unique_nums = set(nums)
-        return len(unique_nums) != len(nums)
+        return len(unique_nums) != len(nums)
+    

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

@@ -29,4 +29,4 @@ def dfs(node):
 
         dfs(root)
 
-        return self.result
+        return self.result

number-of-1-bits/kayden.py

@@ -2,4 +2,4 @@
 # 공간복잡도: O(log N)
 class Solution:
     def hammingWeight(self, n: int) -> int:
-        return bin(n).count("1")
+        return bin(n).count("1")

palindromic-substrings/kayden.py

@@ -19,4 +19,4 @@ def countSubstrings(self, s: str) -> int:
                     isPalindrome[i][j] = True
                     count += 1
 
-        return count
+        return count

top-k-frequent-elements/kayden.py

@@ -4,4 +4,4 @@
 
 class Solution:
     def topKFrequent(self, nums: List[int], k: int) -> List[int]:
-        return [num for num, count in Counter(nums).most_common(k)]
+        return [num for num, count in Counter(nums).most_common(k)]