GH-167: Solve Leetcode 67

Author: quang-ph

collections/leetcode/README.md

@@ -81,7 +81,7 @@
 <td>64</td>
 <td>65</td>
 <td>66</td>
-<td>67</td>
+<td>🟢&nbsp;<a href='https://github.com/rain1024/datastructures-algorithms-competitive-programming/tree/main/problems/leetcode67'>67</a></td>
 <td>68</td>
 <td>69</td>
 <td>70</td>

collections/leetcode/data.yaml

@@ -36,6 +36,9 @@ problems:
 - name: 49
   languages: cpp
   level: medium
+- name: 67
+  languages: python
+  level: easy
 - name: 78
   languages: cpp
   level: medium

problems/leetcode67/.gitignore

@@ -0,0 +1,3 @@
+solution
+*.dSYM
+python/main/__pycache__

problems/leetcode67/README.md

@@ -0,0 +1,10 @@
+# Leetcode Problem 
+
+## Usage
+
+Test program
+
+```
+# Run all tests
+python solution_test.py
+```

problems/leetcode67/data/1.in

@@ -0,0 +1,2 @@
+11
+1

problems/leetcode67/data/1.out

@@ -0,0 +1 @@
+100

problems/leetcode67/data/2.in

@@ -0,0 +1,2 @@
+1010
+1011

problems/leetcode67/data/2.out

@@ -0,0 +1 @@
+10101

problems/leetcode67/problem_infos.json

@@ -0,0 +1,10 @@
+{
+  "name": "67. Add Binary",
+  "link": "https://leetcode.com/problems/add-binary/",
+  "tags": [
+    "Math",
+    "String",
+    "Bit Manipulation",
+    "Simulation"
+  ]
+}

problems/leetcode67/python/main/solution.py

@@ -0,0 +1,38 @@
+class Solution:
+    def addBinary(self, a: str, b: str) -> str:
+        len_a = len(a)
+        len_b = len(b)
+        max_len = len_a
+        if len_a > len_b:
+            gap = len_a - len_b
+            for i in range(0, gap):
+                b = '0' + b
+        elif len_a < len_b:
+            max_len = len_b
+            gap = len_b - len_a
+            for i in range(0, gap):
+                a = '0' + a
+        temp = 0
+        result = []
+        a = list(a)
+        b = list(b)
+        a.reverse()
+        b.reverse()
+        for i, bit_a in enumerate(a):
+            sum_bit = int(bit_a) + int(b[i]) + temp
+            if sum_bit == 3:
+                result.append('1')
+                temp = 1
+            elif sum_bit == 2:
+                result.append('0')
+                temp = 1
+            elif sum_bit == 1:
+                result.append('1')
+                temp = 0
+            elif sum_bit == 0:
+                result.append('0')
+                temp = 0
+        if temp == 1:
+            result.append('1')
+        result.reverse()
+        return ''.join(result)

problems/leetcode67/python/tests/solution_test.py

@@ -0,0 +1,47 @@
+import sys
+import unittest
+from os import listdir
+from os.path import abspath, dirname, join
+
+python_source = dirname(dirname(abspath(__file__)))
+sys.path.append(python_source)
+from main.solution import Solution
+
+test_data_directory = join(dirname(python_source), 'data')
+test_cases = set([data_file.split('.')[0] for data_file in listdir(test_data_directory)])
+
+def read_input(input_file):
+    with open(input_file, 'r') as f:
+        a = f.readline().strip()
+        b = f.readline().strip()
+    return a, b
+
+def read_output(output_file):
+    with open(output_file, 'r') as f:
+        k = f.readline().strip()
+        return k
+
+class TestSequenceMeta(type):
+    def __new__(mcs, name, bases, dict):
+
+        def gen_test(input_file, output_file):
+            def test(self):
+                solution = Solution()
+                nums, val = read_input(input_file)
+                expected_k = read_output(output_file)
+                actual_k = solution.addBinary(nums, val)
+                self.assertEqual(actual_k, expected_k)
+            return test
+
+        for test_case in test_cases:
+            test_name = f'test_{test_case}'
+            input_file = join(test_data_directory, f'{test_case}.in')
+            output_file = join(test_data_directory, f'{test_case}.out')
+            dict[test_name] = gen_test(input_file, output_file)
+        return type.__new__(mcs, name, bases, dict)
+
+class TestSequence(unittest.TestCase, metaclass=TestSequenceMeta):
+    pass
+
+if __name__ == '__main__':
+    unittest.main()

tools/craft/templates/leetcode/.gitignore

@@ -1,2 +1,3 @@
 solution
-*.dSYM
+*.dSYM
+python/main/__pycache__