refacotr

Author: cssmason

README.md

@@ -1,12 +1,14 @@
 from typing import List
+
+
 class Solution:
-    def twoSum(self, nums: List[int], target: int) -> List[int]:
+    def twoSum(self, nums: List[int], target: int) -> List[int]:  # type: ignore
         """
         :type nums: List[int]
         :type target: int
         :rtype: List[int]
         """
-        numMap = {} # value: index
+        numMap = {}  # value: index
         for index, value in enumerate(nums):
             diff = target - value
             if diff in numMap:
@@ -17,4 +19,4 @@ def twoSum(self, nums: List[int], target: int) -> List[int]:
 if __name__ == '__main__':
     nums = [2, 3, 5, 7, 11, 15]
     target = 9
-    print(Solution().twoSum(nums, target))
+    print(Solution().twoSum(nums, target))

leetcode/python/0001-Two-Sum/TwoSum.py leetcode/python/0001-Two-Sum/solution.py

@@ -1,10 +1,12 @@
 from typing import Optional
 
 # Definition for singly-linked list.
-# class ListNode:
-#     def __init__(self, val=0, next=None):
-#         self.val = val
-#         self.next = next
+
+
+class ListNode:
+    def __init__(self, val=0, next=None):
+        self.val = val
+        self.next = next
 
 
 class Solution:

leetcode/python/0002-Add-Two-Numbers/AddTwoNumbers.py leetcode/python/0002-Add-Two-Numbers/solution.py

@@ -1,10 +1,14 @@
+import math
+import re
+
+
 class Solution:
     def myAtoi(self, s: str) -> int:
         s = s.strip()
-        
+
         if not s:
             return 0
-        
+
         match_str = re.findall(r"^[+-]?\d+", s)
 
         if not match_str:
@@ -19,4 +23,4 @@ def myAtoi(self, s: str) -> int:
         else:
             res = int(match_str[0])
 
-        return res
+        return res

leetcode/python/0003-Longest-Substring-Without-Repeating-Characters/LongestSubstringWithoutRepeatingCharacters.py leetcode/python/0003-Longest-Substring-Without-Repeating-Characters/solution.py

@@ -1,11 +1,12 @@
 class Solution:
     def intToRoman(self, num: int) -> str:
-        symbols = ["M", "CM", "D", "CD", "C", "XC", "L", "XL", "X", "IX", "V", "IV", "I"]
+        symbols = ["M", "CM", "D", "CD", "C", "XC",
+                   "L", "XL", "X", "IX", "V", "IV", "I"]
         bases = [1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1]
         res = ""
         for symbol, base in zip(symbols, bases):
             if num // base:
                 count = num // base
                 res += symbol * count
                 num = num % base
-        return res
+        return res

leetcode/python/0005-Longest-Palindromic-Substring/LongestPalindromicSubstring.py leetcode/python/0005-Longest-Palindromic-Substring/solution.py

@@ -1,6 +1,7 @@
 class Solution:
     def romanToInt(self, s: str) -> int:
-        dict = {'I': 1, 'V': 5, 'X': 10, 'L': 50, 'C': 100, 'D': 500, 'M': 1000}
+        dict = {'I': 1, 'V': 5, 'X': 10, 'L': 50,
+                'C': 100, 'D': 500, 'M': 1000}
         ans = 0
         for i in range(len(s)):
             if i < len(s)-1 and dict[s[i]] < dict[s[i+1]]:
@@ -9,6 +10,7 @@ def romanToInt(self, s: str) -> int:
                 ans += dict[s[i]]
         return ans
 
+
 if __name__ == '__main__':
     s = "MCMXCIV"
-    print(Solution().romanToInt(s))
+    print(Solution().romanToInt(s))

leetcode/python/0007-Reverse-Integer/ReverseInteger.py leetcode/python/0007-Reverse-Integer/solution.py

@@ -1,4 +1,6 @@
 from typing import List
+
+
 class Solution:
     def longestCommonPrefix(self, strs: List[str]) -> str:
         last = strs.pop()
@@ -8,6 +10,7 @@ def longestCommonPrefix(self, strs: List[str]) -> str:
                     return last[:index]
         return last
 
+
 if __name__ == '__main__':
     strs = ["flower", "flow", "flight"]
-    print(Solution().longestCommonPrefix(strs))
+    print(Solution().longestCommonPrefix(strs))

leetcode/python/0008-String-to-Integer/StringtoInteger.py leetcode/python/0008-String-to-Integer/solution.py

@@ -27,6 +27,7 @@ def threeSum(self, nums: List[int]) -> List[List[int]]:
                         right -= 1
         return res
 
+
 if __name__ == '__main__':
-    nums = [-1,0,1,2,-1,-4]
-    print(Solution().threeSum(nums))
+    nums = [-1, 0, 1, 2, -1, -4]
+    print(Solution().threeSum(nums))

leetcode/python/0012-Integer-to-Roman/IntegertoRoman.py leetcode/python/0012-Integer-to-Roman/solution.py

@@ -1,8 +1,13 @@
+from typing import Optional
 # Definition for singly-linked list.
-# class ListNode:
-#     def __init__(self, val=0, next=None):
-#         self.val = val
-#         self.next = next
+
+
+class ListNode:
+    def __init__(self, val=0, next=None):
+        self.val = val
+        self.next = next
+
+
 class Solution:
     def removeNthFromEnd(self, head: Optional[ListNode], n: int) -> Optional[ListNode]:
         if not head:

leetcode/python/0013-Roman-to-Integer/RomantoInteger.py leetcode/python/0013-Roman-to-Integer/solution.py

@@ -1,11 +1,13 @@
 # Definition for singly-linked list.
-# class ListNode:
-#     def __init__(self, val=0, next=None):
-#         self.val = val
-#         self.next = next
 from typing import Optional
 
 
+class ListNode:
+    def __init__(self, val=0, next=None):
+        self.val = val
+        self.next = next
+
+
 class Solution:
     def mergeTwoLists(self, list1: Optional[ListNode], list2: Optional[ListNode]) -> Optional[ListNode]:
         dummy = temp = ListNode(0)

leetcode/python/0014-Longest-Common-Prefix/LongestCommonPrefix.py leetcode/python/0014-Longest-Common-Prefix/solution.py

@@ -1,7 +1,7 @@
 class Solution:
     def countAndSay(self, n: int) -> str:
         s = "1"
-        
+
         for _ in range(1, n):
             prev, count = "#", 0
             currStr = ""
@@ -12,8 +12,8 @@ def countAndSay(self, n: int) -> str:
                     currStr += str(count) + prev
                     count = 1
                 prev = char
-            
+
             currStr += str(count) + prev
             s = currStr
-        
-        return s
+
+        return s

leetcode/python/0015-3Sum/3Sum.py leetcode/python/0015-3Sum/solution.py

@@ -1,8 +1,11 @@
+from typing import List
+
+
 class Solution:
     def trap(self, height: List[int]) -> int:
         if not height:
             return 0
-        
+
         res = 0
         left, right = 0, len(height) - 1
         leftMax, rightMax = height[left], height[right]
@@ -15,5 +18,5 @@ def trap(self, height: List[int]) -> int:
                 right -= 1
                 rightMax = max(rightMax, height[right])
                 res += rightMax - height[right]
-        
-        return res
+
+        return res

leetcode/python/0019-Remove-Nth-Node-From-End-of-List/solution.py

@@ -18,7 +18,7 @@ def rotate(self, matrix: List[List[int]]) -> None:
                 matrix[top+i][right] = topLeft
             right -= 1
             left += 1
-        return matrix
+        return matrix  # type: ignore
 
 
 if __name__ == '__main__':

leetcode/python/0020-Valid-Parentheses/ValidParentheses.py leetcode/python/0020-Valid-Parentheses/solution.py

@@ -0,0 +1,37 @@
+from typing import List
+
+
+class Solution:
+    def insert(self, intervals: List[List[int]], newInterval: List[int]) -> List[List[int]]:
+        res = []
+
+        for interval in intervals:
+            if newInterval[1] < interval[0]:
+                res.append(newInterval)
+                newInterval = interval
+            elif newInterval[0] > interval[1]:
+                res.append(interval)
+            else:
+                newInterval = [min(newInterval[0], interval[0]),
+                               max(newInterval[1], interval[1])]
+
+        res.append(newInterval)
+        return res
+
+
+# class Solution:
+#     def insert(self, intervals: List[List[int]], newInterval: List[int]) -> List[List[int]]:
+#         res = []
+
+#         for i in range(len(intervals)):
+#             if newInterval[1] < intervals[i][0]:
+#                 res.append(newInterval)
+#                 return res + intervals[i:]
+#             elif newInterval[0] > intervals[i][1]:
+#                 res.append(intervals[i])
+#             else:
+#                 newInterval = [min(newInterval[0], intervals[i][0]), max(
+#                     newInterval[1], intervals[i][1])]
+
+#         res.append(newInterval)
+#         return res

leetcode/python/0021-Merge-Two-Sorted-Lists/MergeTwoSortedLists.py leetcode/python/0021-Merge-Two-Sorted-Lists/solution.py

@@ -1,23 +1,28 @@
+from typing import Optional
 # Definition for singly-linked list.
-# class ListNode:
-#     def __init__(self, val=0, next=None):
-#         self.val = val
-#         self.next = next
+
+
+class ListNode:
+    def __init__(self, val=0, next=None):
+        self.val = val
+        self.next = next
+
+
 class Solution:
     def rotateRight(self, head: Optional[ListNode], k: int) -> Optional[ListNode]:
         if not head or k == 0:
             return head
-        
+
         curr, length = head, 0
         while curr:
             length += 1
             prev, curr = curr, curr.next
-        else: 
+        else:
             prev.next = head
 
         count = length - (k % length)
 
         for _ in range(count):
             prev, head = head, head.next
         prev.next = None
-        return head
+        return head

leetcode/python/0026-Remove-Duplicates-from-Sorted-Array/RemoveDuplicatesfromSortedArray.py leetcode/python/0026-Remove-Duplicates-from-Sorted-Array/solution.py

@@ -1,3 +1,3 @@
 class Solution:
     def addBinary(self, a: str, b: str) -> str:
-        return bin(int(a, 2) + int(b, 2))[2:]
+        return bin(int(a, 2) + int(b, 2))[2:]

leetcode/python/0027-Remove-Element/RemoveElement.py leetcode/python/0027-Remove-Element/solution.py

@@ -12,4 +12,4 @@ def simplifyPath(self, path: str) -> str:
 
 if __name__ == '__main__':
     path = "/home/"
-    print(Solution().simplifyPath(path))
+    print(Solution().simplifyPath(path))

leetcode/python/0028-Find-the-Index-of-the-First-Occurrence-in-a-String/FindtheIndexoftheFirstOccurrenceinaString.py leetcode/python/0028-Find-the-Index-of-the-First-Occurrence-in-a-String/solution.py

@@ -1,3 +1,6 @@
+from typing import List
+
+
 class Solution:
     def sortColors(self, nums: List[int]) -> None:
         """
@@ -12,5 +15,5 @@ def sortColors(self, nums: List[int]) -> None:
             elif nums[p1] == 2:
                 nums[p1], nums[p2] = nums[p2], nums[p1]
                 p2 -= 1
-            else: 
+            else:
                 p1 += 1

leetcode/python/0033-Search-in-Rotated-Sorted-Array/SearchinRotatedSortedArray.py leetcode/python/0033-Search-in-Rotated-Sorted-Array/solution.py

@@ -1,3 +1,6 @@
+import collections
+
+
 class Solution:
     def minWindow(self, s: str, t: str) -> str:
         if not t or not s:
@@ -8,7 +11,7 @@ def minWindow(self, s: str, t: str) -> str:
         res, res_len = [None, None], float("inf")
         window_count = {}
         left, right = 0, 0
-        
+
         while right < len(s):
             char = s[right]
             window_count[char] = 1 + window_count.get(char, 0)
@@ -21,8 +24,8 @@ def minWindow(self, s: str, t: str) -> str:
 
                 if right - left + 1 < res_len:
                     res = [left, right]
-                    res_len  = right - left + 1
-                
+                    res_len = right - left + 1
+
                 window_count[char] -= 1
                 if char in t_count and window_count[char] < t_count[char]:
                     have -= 1
@@ -33,7 +36,4 @@ def minWindow(self, s: str, t: str) -> str:
 
         left, right = res
 
-        return s[left : right + 1] if res_len != float("inf") else ""
-
-                    
-
+        return s[left: right+1] if res_len != float("inf") else ""