Add line break and remove unnecessary string conversion

Author: sean424

best-time-to-buy-and-sell-stock/bhyun-kim.py

@@ -14,30 +14,27 @@
 
 from typing import List
 
+
 class Solution:
     def maxProfit(self, prices: List[int]) -> int:
         profit = 0
         prev_max = 0
 
-        for i in reversed(range(len(prices)-1)):
-            prev_max = max(prev_max, prices[i+1])
-            profit = max(profit, prev_max-prices[i])
+        for i in reversed(range(len(prices) - 1)):
+            prev_max = max(prev_max, prices[i + 1])
+            profit = max(profit, prev_max - prices[i])
 
         return profit
-        
 
 
 def main():
-    test_cases = [
-        [[7,1,5,3,6,4], 5],
-        [[7,6,4,3,1], 0]
-    ]
+    test_cases = [[[7, 1, 5, 3, 6, 4], 5], [[7, 6, 4, 3, 1], 0]]
     s = Solution()
-    
+
     for test_case in test_cases:
         prices_input, expected = test_case
         assert s.maxProfit(prices_input) == expected
 
-if __name__ == '__main__':
+
+if __name__ == "__main__":
     main()
-    

contains-duplicate/bhyun-kim.py

@@ -13,22 +13,26 @@
 
 from typing import List
 
+
 class Solution:
     def containsDuplicate(self, nums: List[int]) -> bool:
         return len(set(nums)) != len(nums)
 
+
 def main():
     test_cases = [
-        [[1,2,3,1], True,]
-        [[1,2,3,4], False],
-        [[1,1,1,3,3,4,3,2,4,2], True]
+        [
+            [1, 2, 3, 1],
+            True,
+        ][[1, 2, 3, 4], False],
+        [[1, 1, 1, 3, 3, 4, 3, 2, 4, 2], True],
     ]
     s = Solution()
-    
+
     for test_case in test_cases:
         nums_input, expected = test_case
         assert s.containsDuplicate(nums_input) == expected
 
-if __name__ == '__main__':
+
+if __name__ == "__main__":
     main()
-    

two-sum/bhyun-kim.py

@@ -13,9 +13,9 @@
 
 from typing import List
 
+
 class Solution:
     def twoSum(self, nums: List[int], target: int) -> List[int]:
-        
         hashmap = {}
 
         for i in range(len(nums)):
@@ -25,18 +25,15 @@ def twoSum(self, nums: List[int], target: int) -> List[int]:
 
             hashmap[nums[i]] = i
 
+
 def main():
-    test_cases = [
-        [2,7,11,15], 9, [0,1],
-        [3,2,4], 6, [1,2],
-        [3,3], 6, [0,1]
-    ]
+    test_cases = [[2, 7, 11, 15], 9, [0, 1], [3, 2, 4], 6, [1, 2], [3, 3], 6, [0, 1]]
     s = Solution()
-    
+
     for test_case in test_cases:
         nums_input, target_input, expected = test_case
         assert sorted(s.twoSum(nums_input, target_input)) == expected
 
-if __name__ == '__main__':
+
+if __name__ == "__main__":
     main()
-    

valid-anagram/bhyun-kim.py

@@ -9,26 +9,23 @@
 Space complexity: O(1)
 """
 
+
 class Solution:
     def isAnagram(self, s: str, t: str) -> bool:
-
         if sorted(s) == sorted(t):
             return True
         else:
             return False
 
 
 def main():
-    test_cases = [
-        ["anagram", "nagaram", True],
-        ["rat", "car", False]
-    ]
+    test_cases = [["anagram", "nagaram", True], ["rat", "car", False]]
     s = Solution()
-    
+
     for test_case in test_cases:
         s_input, t_input, expected = test_case
         assert s.isAnagram(s_input, t_input) == expected
 
-if __name__ == '__main__':
+
+if __name__ == "__main__":
     main()
-    

valid-palindrome/bhyun-kim.py

@@ -14,22 +14,23 @@
 class Solution:
     def isPalindrome(self, s: str) -> bool:
         s = s.lower()
-        s = list([c for c in s
-            if c.isalpha() or c.isnumeric()])
-        s = "".join(s)
+        s = [c for c in s if c.isalpha() or c.isnumeric()]
         return s == s[::-1]
 
+
 def main():
     test_cases = [
         ["A man, a plan, a canal: Panama", True],
         ["race a car", False],
-        [" ", True]
+        [" ", True],
     ]
     s = Solution()
-    
+
     for test_case in test_cases:
         s_input, expected = test_case
         assert s.isPalindrome(s_input) == expected
 
-if __name__ == '__main__':
+
+if __name__ == "__main__":
     main()
+