|
| 1 | +import unittest |
| 2 | + |
| 3 | +from problems.array.merge_sorted_array import MergeSortedArray |
| 4 | + |
| 5 | + |
| 6 | +class TestMergeSortedArray(unittest.TestCase): |
| 7 | + |
| 8 | + def setUp(self): |
| 9 | + self.merge_sorted_array = MergeSortedArray() |
| 10 | + |
| 11 | + def test_both_non_empty(self): |
| 12 | + nums1 = [1, 2, 3, 0, 0, 0] |
| 13 | + nums2 = [2, 5, 6] |
| 14 | + m = 3 |
| 15 | + n = 3 |
| 16 | + self.assertEqual(self.merge_sorted_array.merge(nums1, m, nums2, n), [1, 2, 2, 3, 5, 6]) |
| 17 | + |
| 18 | + def test_empty_nums2(self): |
| 19 | + nums1 = [1, 2, 3] |
| 20 | + nums2 = [] |
| 21 | + m = 3 |
| 22 | + n = 0 |
| 23 | + self.assertEqual(self.merge_sorted_array.merge(nums1, m, nums2, n), [1, 2, 3]) |
| 24 | + |
| 25 | + def test_empty_nums1(self): |
| 26 | + nums1 = [0, 0, 0] |
| 27 | + nums2 = [1, 2, 3] |
| 28 | + m = 0 |
| 29 | + n = 3 |
| 30 | + self.assertEqual(self.merge_sorted_array.merge(nums1, m, nums2, n), [1, 2, 3]) |
| 31 | + |
| 32 | + def test_empty_both(self): |
| 33 | + nums1 = [] |
| 34 | + nums2 = [] |
| 35 | + m = 0 |
| 36 | + n = 0 |
| 37 | + self.assertEqual(self.merge_sorted_array.merge(nums1, m, nums2, n), []) |
| 38 | + |
| 39 | + def test_single_element_nums1(self): |
| 40 | + nums1 = [1] |
| 41 | + nums2 = [] |
| 42 | + m = 1 |
| 43 | + n = 0 |
| 44 | + self.assertEqual(self.merge_sorted_array.merge(nums1, m, nums2, n), [1]) |
| 45 | + |
| 46 | + def test_single_element_nums2(self): |
| 47 | + nums1 = [0] |
| 48 | + nums2 = [1] |
| 49 | + m = 0 |
| 50 | + n = 1 |
| 51 | + self.assertEqual(self.merge_sorted_array.merge(nums1, m, nums2, n), [1]) |
| 52 | + |
| 53 | + |
| 54 | +if __name__ == '__main__': |
| 55 | + unittest.main() |
0 commit comments