Linting, formatting, move tests to tests/unit

Author: varvarvarvar

problems/___init__.py

@@ -6,7 +6,7 @@
 """
 
 
-class Solution(object):
+class Solution:
     def twoSum(self, nums, target):
         """
         :type nums: List[int]
@@ -24,6 +24,3 @@ def twoSum(self, nums, target):
         for i, num in enumerate(nums):
             if target - num in val2id and i != val2id[target - num]:
                 return i, val2id[target - num]
-
-
-assert Solution().twoSum([2, 7, 11, 15], 9) == (0, 1)

solutions/0001.py renamed to problems/problem_0001.py

@@ -0,0 +1,62 @@
+"""You are given two non-empty linked lists representing
+two non-negative integers.
+
+The digits are stored in reverse order,
+and each of their nodes contains a single digit.
+Add the two numbers and return the sum as a linked list.
+
+You may assume the two numbers do not contain any leading zero,
+except the number 0 itself.
+
+"""
+
+
+# Definition of singly-linked list.
+class ListNode:
+    def __init__(self, val=0, next_val=None):
+        self.val = val
+        self.next_val = next_val
+
+
+class Solution:
+    def addTwoNumbers(self, l1: ListNode, l2: ListNode) -> ListNode:
+
+        remainder = 0
+
+        dummy = ListNode()
+        last = dummy
+
+        while True:
+
+            s = l1.val + l2.val + remainder
+            s, remainder = s % 10, s // 10
+
+            new_last = ListNode(val=s)
+
+            last.next_val = new_last
+            last = new_last
+
+            if l1.next_val is None and l2.next_val is None and remainder == 0:
+                break
+
+            if l1.next_val is not None:
+                l1 = l1.next_val
+            else:
+                l1 = ListNode()
+
+            if l2.next_val is not None:
+                l2 = l2.next_val
+            else:
+                l2 = ListNode()
+
+        return dummy.next_val
+
+
+def listnode2array(l):
+    result_array = []
+    while True:
+        result_array.append(l.val)
+        if l.next_val is None:
+            break
+        l = l.next_val
+    return result_array

problems/problem_0002.py

@@ -16,15 +16,6 @@ def reverse(self, x: int) -> int:
 
         x = int("".join(x))
         x *= sign
-        x *= -(2 ** 31) <= x <= 2 ** 31 - 1
+        x *= -(2**31) <= x <= 2**31 - 1
 
         return x
-
-
-sol = Solution()
-
-assert sol.reverse(-123) == -321
-assert sol.reverse(120) == 21
-assert sol.reverse(0) == 0
-assert sol.reverse(1534236469) == 0
-assert sol.reverse(1) == 1

solutions/0007.py renamed to problems/problem_0007.py

@@ -5,15 +5,15 @@
 
 class Solution:
     def get_digit(self, num, i):
-        return (num % 10 ** (i + 1) - num % 10 ** i) / 10 ** i
+        return (num % 10 ** (i + 1) - num % 10**i) / 10**i
 
     def isPalindrome(self, x):
 
         if x < 0:
             return False
 
         for i in range(20):
-            if x < 10 ** i:
+            if x < 10**i:
                 num_digits = i
                 break
 
@@ -27,9 +27,3 @@ def isPalindrome(self, x):
                 return False
 
         return True
-
-
-assert not Solution().isPalindrome(9223372036854775807)
-assert not Solution().isPalindrome(12822)
-assert not Solution().isPalindrome(-2147447412)
-assert Solution().isPalindrome(121)

solutions/0009.py renamed to problems/problem_0009.py

@@ -29,12 +29,3 @@ def maxArea(self, height: List[int]) -> int:
                 idx1 -= 1
 
         return max_area
-
-
-sol = Solution()
-
-assert sol.maxArea([1, 8, 6, 2, 5, 4, 8, 3, 7]) == 49
-assert sol.maxArea([3, 9, 3, 4, 7, 2, 12, 6]) == 45
-assert sol.maxArea([1, 2]) == 1
-assert sol.maxArea([1, 3, 2, 5, 25, 24, 5]) == 24
-assert sol.maxArea([1, 1]) == 1

solutions/0011.py renamed to problems/problem_0011.py

@@ -37,10 +37,3 @@ def romanToInt(self, s: str) -> int:
             res_sum += roman_mapper[s[i]]
 
         return res_sum
-
-
-sol = Solution()
-
-assert sol.romanToInt("IX") == 9
-assert sol.romanToInt("LVIII") == 58
-assert sol.romanToInt("MCMXCIV") == 1994

solutions/0013.py renamed to problems/problem_0013.py

@@ -17,13 +17,3 @@ def longestCommonPrefix(self, strs) -> str:
                 return "".join(prefix)
             prefix.append(chars[0])
         return "".join(prefix)
-
-
-sol = Solution()
-
-assert sol.longestCommonPrefix(["flower", "flow", "flight"]) == "fl"
-assert sol.longestCommonPrefix(["dog", "racecar", "car"]) == ""
-assert sol.longestCommonPrefix(["aca", "cba"]) == ""
-assert sol.longestCommonPrefix(["ab", "ab"]) == "ab"
-assert sol.longestCommonPrefix([]) == ""
-assert sol.longestCommonPrefix(["", "b"]) == ""

solutions/0014.py renamed to problems/problem_0014.py

@@ -34,18 +34,3 @@ def threeSum(self, nums: List[int]) -> List[List[int]]:
                     idx1 -= 1
 
         return list(set(res))
-
-
-sol = Solution()
-assert sol.threeSum([-1, 0, 1, 2, -1, -4]) == [(-1, 0, 1), (-1, -1, 2)]
-assert sol.threeSum([-1, 0, 1, 2, -1, -4, -2, -3, 3, 0, 4]) == [
-    (-3, -1, 4),
-    (-1, 0, 1),
-    (-4, 1, 3),
-    (-2, 0, 2),
-    (-1, -1, 2),
-    (-3, 0, 3),
-    (-4, 0, 4),
-    (-2, -1, 3),
-    (-3, 1, 2),
-]

solutions/0015.py renamed to problems/problem_0015.py

@@ -25,12 +25,3 @@ def isValid(self, s: str) -> bool:
                 return False
 
         return not stack
-
-
-assert Solution().isValid("()")
-assert Solution().isValid("()[]{}")
-assert not Solution().isValid("(]")
-assert not Solution().isValid("([)]")
-assert Solution().isValid("{[]}")
-assert Solution().isValid("(((((())))))")
-assert Solution().isValid("{}{}()[]")

solutions/0020.py renamed to problems/problem_0020.py

@@ -8,6 +8,9 @@
 
 
 class Solution:
+    def __init__(self):
+        self.nums = None
+
     def removeDuplicates(self, nums, debug_mode=False) -> int:
 
         len_nums = len(nums)
@@ -28,14 +31,3 @@ def removeDuplicates(self, nums, debug_mode=False) -> int:
             self.nums = nums[: last_correct_idx + 1]
 
         return last_correct_idx + 1
-
-
-sol = Solution()
-
-assert sol.removeDuplicates([0, 0, 1, 1, 1, 2, 2, 3, 3, 4], debug_mode=True) == 5
-assert sol.nums == [0, 1, 2, 3, 4]
-
-assert sol.removeDuplicates([1, 1, 2], debug_mode=True) == 2
-assert sol.nums == [1, 2]
-
-assert sol.removeDuplicates([]) == 0

solutions/0026.py renamed to problems/problem_0026.py

@@ -9,31 +9,22 @@
 
 
 class Solution:
-    def __init__(self, debug_mode=False):
-        self.debug_mode = debug_mode
+    def __init__(self):
+        self.nums = None
 
     def removeElement(self, nums, val, debug_mode=False) -> int:
 
         last_correct_idx = 0
 
-        for i in range(len(nums)):
+        for nums_val in nums:
 
-            if nums[i] == val:
+            if nums_val == val:
                 continue
 
-            nums[last_correct_idx] = nums[i]
+            nums[last_correct_idx] = nums_val
             last_correct_idx += 1
 
-        if self.debug_mode:
+        if debug_mode:  # Sanity check
             self.nums = nums[:last_correct_idx]
 
         return last_correct_idx
-
-
-sol = Solution(debug_mode=True)
-
-assert sol.removeElement([3, 2, 2, 3], 3) == 2
-assert sol.nums == [2, 2]
-
-assert sol.removeElement([0, 1, 2, 2, 3, 0, 4, 2], 2) == 5
-assert sol.nums == [0, 1, 3, 0, 4]

solutions/0027.py renamed to problems/problem_0027.py

@@ -38,18 +38,3 @@ def strStr(self, haystack: str, needle: str) -> int:
                     return i
 
         return -1
-
-
-if __name__ == "__main__":
-
-    sol = Solution()
-
-    assert sol.strStr("aaa", "aaaa") == -1
-    assert sol.strStr("mississippi", "issip") == 4
-    assert sol.strStr("hello", "ll") == 2
-    assert sol.strStr("aaa", "aaa") == 0
-    assert sol.strStr("a", "a") == 0
-    assert sol.strStr("aaa", "aaa") == 0
-    assert sol.strStr("ba", "a") == 1
-    assert sol.strStr("aaaaa", "bba") == -1
-    assert sol.strStr("", "") == 0

solutions/0028.py renamed to problems/problem_0028.py

@@ -11,7 +11,7 @@
 """
 
 
-class Solution(object):
+class Solution:
     def merge(self, left_part, right_part, a):
         i = 0
         j = 0
@@ -50,8 +50,3 @@ def merge_sort(self, a):
 
     def sortColors(self, nums):
         self.merge_sort(nums)
-
-
-colors = [2, 0, 2, 1, 1, 0]
-Solution().sortColors(colors)
-assert colors == [0, 0, 1, 1, 2, 2]

solutions/0075.py renamed to problems/problem_0075.py

@@ -32,9 +32,3 @@ def isPalindrome(self, s):
                     j -= 1
 
         return True
-
-
-assert Solution().isPalindrome("a,ba")
-assert Solution().isPalindrome("A man, a plan, a canal: Panama")
-assert not (Solution().isPalindrome("race a car"))
-assert Solution().isPalindrome("")

solutions/0125.py renamed to problems/problem_0125.py

@@ -39,12 +39,3 @@ def rotate(self, nums, k):
             tmp = nums[i]
             nums[i] = nums[i + 1]
             nums[i + 1] = tmp
-
-
-nums = []
-Solution().rotate(nums, 1)
-assert nums == []
-
-nums = [1, 2, 3, 4, 5, 6, 7]
-Solution().rotate(nums, 3)
-assert nums == [5, 6, 7, 1, 2, 3, 4]

solutions/0189.py renamed to problems/problem_0189.py

@@ -28,11 +28,3 @@ def rob(self, nums: List[int]) -> int:
             rob1 = current
 
         return max(rob0, rob1)
-
-
-sol = Solution()
-
-assert sol.rob([2, 1, 1, 2]) == 4
-assert sol.rob([]) == 0
-assert sol.rob([2, 7, 9, 3, 1]) == 12
-assert sol.rob([1, 2, 3, 1]) == 4

solutions/0198.py renamed to problems/problem_0198.py

@@ -20,14 +20,11 @@ def countPrimes(self, n):
         sieve = [True] * n
         sieve[0], sieve[1] = False, False
 
-        for i in range(2, int(n ** 0.5) + 1):
+        for i in range(2, int(n**0.5) + 1):
 
             if not sieve[i]:
                 continue
 
             sieve[i * i : n : i] = [False] * len(sieve[i * i : n : i])
 
         return sum(sieve)
-
-
-assert Solution().countPrimes(999983) == 78497

solutions/0204.py renamed to problems/problem_0204.py

@@ -19,16 +19,3 @@ def reverseString(self, s: List[str]) -> None:
             s[i], s[j] = s[j], s[i]
             i += 1
             j -= 1
-
-
-if __name__ == "__main__":
-
-    sol = Solution()
-
-    s = ["h", "e", "l", "l", "o"]
-    sol.reverseString(s)
-    assert s == ["o", "l", "l", "e", "h"]
-
-    s = ["H", "a", "n", "n", "a", "h"]
-    sol.reverseString(s)
-    assert s == ["h", "a", "n", "n", "a", "H"]

solutions/0344.py renamed to problems/problem_0344.py

@@ -15,7 +15,7 @@
 """
 
 
-class Solution(object):
+class Solution:
     def findDuplicates(self, nums):
         res = []
         for num in nums:
@@ -24,6 +24,3 @@ def findDuplicates(self, nums):
             else:
                 nums[abs(num) - 1] *= -1
         return res
-
-
-assert Solution().findDuplicates([4, 3, 2, 7, 8, 2, 3, 1]) == [2, 3]

solutions/0442.py renamed to problems/problem_0442.py

@@ -23,7 +23,7 @@
 """
 
 
-class Solution(object):
+class Solution:
     def fourSumCount(self, A, B, C, D):
         res = 0
         cnt = {}
@@ -42,6 +42,3 @@ def fourSumCount(self, A, B, C, D):
                     res += cnt[current_dif]
 
         return res
-
-
-assert Solution().fourSumCount([1, 2], [-2, -1], [-1, 2], [0, 2]) == 2