start from beginning

Author: LEUNGUU

.pre-commit-config.yaml

@@ -2,7 +2,7 @@
 # See https://pre-commit.com/hooks.html for more hooks
 repos:
 -   repo: https://github.com/pre-commit/pre-commit-hooks
-    rev: v2.4.0
+    rev: v4.3.0
     hooks:
     -   id: trailing-whitespace
     -   id: end-of-file-fixer
@@ -13,7 +13,7 @@ repos:
     rev: stable
     hooks:
     - id: black
-      language_version: python3.7
+      language_version: python3.10
 
 # -   repo: https://gitlab.com/pycqa/flake8
 #     rev: 3.7.9

Makefile

@@ -0,0 +1,43 @@
+help:
+	@echo "install - install a virtualenv for development and deployment"
+	@echo "fmt - format source code with black"
+	@echo "test - run unit tests"
+	@echo "deploy - deploy all your pipelines"
+	@echo "clean - remove build, test, and Python artifacts locally"
+
+VENV = venv
+PYTHON = $(VENV)/bin/python3
+PIP = $(VENV)/bin/pip
+
+.PHONY: venv
+venv:
+	@test -d "venv" || mkdir -p "venv"
+	@rm -Rf "venv"
+	@python3 -m venv "venv"
+
+install: upgrade-pip install-tests
+
+upgrade-pip:
+	$(PIP) install --upgrade pip setuptools
+
+install-tests:
+	$(PIP) install -r tests/requirements.txt
+
+fmt:
+	$(PIP) install black
+	$(PYTHON) -m black .
+
+test:
+	export PYTHONPATH=".:./src" && \
+	$(PYTHON) -m pytest tests/
+
+clean:
+	@rm -fr .tox/
+	@rm -fr .venv/
+	@find . -name '*.egg-info' -exec rm -fr {} +
+	@find . -name "*.py[co]" -o -name .pytest_cache -exec rm -rf {} +
+	@find . -name '*.egg' -exec rm -f {} +
+	@find . -name '*.pyc' -exec rm -f {} +
+	@find . -name '*.pyo' -exec rm -f {} +
+	@find . -name '*~' -exec rm -f {} +
+	@find . -name '__pycache__' -exec rm -fr {} +

easy/1.two_sum.py renamed to bak/1.two_sum.py

@@ -29,6 +29,8 @@ def twoSum(self, nums: List[int], target: int) -> List[int]:
                 return [result[res], index]
             else:
                 result[value] = index
+
+
 #
 #
 # # two-pass hash table [Accepted]
@@ -41,6 +43,8 @@ def twoSum(self, nums: List[int], target: int) -> List[int]:
             res = target - nums[index]
             if res in nums_dict and nums_dict[res] != index:
                 return [index, nums_dict[res]]
+
+
 #
 #
 # # Bruce Force [Not Accepted, Time exceeded]
@@ -51,12 +55,13 @@ def twoSum(self, nums: List[int], target: int) -> List[int]:
                 if nums[idx1] + nums[idx2] == target:
                     return [idx1, idx2]
 
+
 # two pointers
 class Solution:
     def twoSum(self, nums: List[int], target: int) -> List[int]:
         sorted_nums = sorted(nums)
         lo = 0
-        hi = len(nums) -1
+        hi = len(nums) - 1
         while lo < hi:
             total = sorted_nums[lo] + sorted_nums[hi]
             left = sorted_nums[lo]
@@ -74,5 +79,3 @@ def twoSum(self, nums: List[int], target: int) -> List[int]:
                         res.append(index)
                 return res
         return []
-
-

easy/10.regular_expression_matching.py renamed to bak/10.regular_expression_matching.py

@@ -90,7 +90,11 @@ def check(p, q):
                 return False
             return True
 
-        deq = deque([(p, q),])
+        deq = deque(
+            [
+                (p, q),
+            ]
+        )
         while deq:
             p, q = deq.popleft()
             if not check(p, q):

easy/100.same_tree.py renamed to bak/100.same_tree.py

@@ -61,13 +61,16 @@ def height(self, node: TreeNode) -> int:
         # recursive calculate the height
         return 1 + max(self.height(node.left), self.height(node.right))
 
-
     def isBalanced(self, root: TreeNode) -> bool:
         if not root:
             return True
         # every subtree must be balanced
-        return abs(self.height(root.left) - self.height(root.right)) < 2 \
-                and self.isBalanced(root.left) and self.isBalanced(root.right)
+        return (
+            abs(self.height(root.left) - self.height(root.right)) < 2
+            and self.isBalanced(root.left)
+            and self.isBalanced(root.right)
+        )
+
 
 # bottom up solution
 class Solution: