GH-285: solve leetcode 88 (#307)

quang-ph · web-flow · commit 8c80955a43b6 · 2023-05-08T07:17:09.000+07:00
diff --git a/collections/leetcode/README.md b/collections/leetcode/README.md
@@ -104,7 +104,7 @@
 <td>85</td>
 <td>86</td>
 <td>87</td>
-<td>88</td>
+<td>🟢&nbsp;<a href='https://github.com/rain1024/datastructures-algorithms-competitive-programming/tree/main/problems/leetcode88'>88</a></td>
 <td>89</td>
 <td>90</td>
 <tr>
diff --git a/collections/leetcode/data.yaml b/collections/leetcode/data.yaml
@@ -45,6 +45,9 @@ problems:
 - name: 78
   languages: cpp
   level: medium
+- name: 88
+  languages: python
+  level: easy
 - name: 101
   languages: cpp
   level: easy
diff --git a/problems/leetcode88/.gitignore b/problems/leetcode88/.gitignore
@@ -0,0 +1,3 @@
+solution
+*.dSYM
+python/main/__pycache__
diff --git a/problems/leetcode88/README.md b/problems/leetcode88/README.md
@@ -0,0 +1,10 @@
+# Leetcode Problem 
+
+## Usage
+
+Test program
+
+```
+# Run all tests
+python solution_test.py
+```
diff --git a/problems/leetcode88/data/1.in b/problems/leetcode88/data/1.in
@@ -0,0 +1,4 @@
+1,2,3,0,0,0
+3
+2,5,6
+3
diff --git a/problems/leetcode88/data/1.out b/problems/leetcode88/data/1.out
@@ -0,0 +1 @@
+1,2,2,3,5,6
diff --git a/problems/leetcode88/data/2.in b/problems/leetcode88/data/2.in
@@ -0,0 +1,4 @@
+1
+1
+_
+0
diff --git a/problems/leetcode88/data/2.out b/problems/leetcode88/data/2.out
@@ -0,0 +1 @@
+1
diff --git a/problems/leetcode88/data/3.in b/problems/leetcode88/data/3.in
@@ -0,0 +1,4 @@
+0
+0
+1
+1
diff --git a/problems/leetcode88/data/3.out b/problems/leetcode88/data/3.out
@@ -0,0 +1 @@
+1
diff --git a/problems/leetcode88/problem_infos.json b/problems/leetcode88/problem_infos.json
@@ -0,0 +1,9 @@
+{
+  "name": "Leetcode 88. Merge Sorted Array",
+  "link": "https://leetcode.com/problems/merge-sorted-array/",
+  "tags": [
+    "Array",
+    "Two Pointers",
+    "Sorting"
+  ]
+}
diff --git a/problems/leetcode88/python/main/solution.py b/problems/leetcode88/python/main/solution.py
@@ -0,0 +1,23 @@
+from typing import List
+
+
+class Solution:
+    def merge(self, nums1: List[int], m: int, nums2: List[int], n: int) -> None:
+        """
+        Do not return anything, modify nums1 in-place instead.
+        """
+        i = m - 1
+        j = n - 1
+        k = m + n - 1
+        while i >= 0 and j >= 0:
+            if nums1[i] > nums2[j]:
+                nums1[k] = nums1[i]
+                i -= 1
+            else:
+                nums1[k] = nums2[j]
+                j -= 1
+            k -= 1
+        while j >= 0:
+            nums1[k] = nums2[j]
+            j -= 1
+            k -= 1
diff --git a/problems/leetcode88/python/tests/solution_test.py b/problems/leetcode88/python/tests/solution_test.py
@@ -0,0 +1,49 @@
+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:
+        nums1 = [int(num) if num != '_' else None for num in f.readline().strip().strip('][').split(',') ]
+        m = int(f.readline().strip())
+        nums2 = [int(num) if num != '_' else None for num in f.readline().strip().strip('][').split(',') ]
+        n = int(f.readline().strip())
+    return nums1, m, nums2, n
+
+def read_output(output_file):
+    with open(output_file, 'r') as f:
+        nums1 = [int(num) if num != '_' else None for num in f.readline().strip().strip('][').split(',') ]
+        return nums1
+
+class TestSequenceMeta(type):
+    def __new__(mcs, name, bases, dict):
+
+        def gen_test(input_file, output_file):
+            def test(self):
+                solution = Solution()
+                nums1, m, nums2, n = read_input(input_file)
+                expected_nums1 = read_output(output_file)
+                solution.merge(nums1, m, nums2, n)
+                self.assertEqual(nums1, expected_nums1)
+            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()

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,3 @@`
	`1`	`+solution`
	`2`	`+*.dSYM`
	`3`	`+python/main/__pycache__`
-Original file line number
+Diff line change
@@ @@ -0,0 +1,4 @@ @@
 +1,2,3,0,0,0
 +3
 +2,5,6
 +3