def test_intersection_two_arrays_ii(self):
# Given nums1 = [1, 2, 2, 1], nums2 = [2, 2], return [2, 2]
self.assertEqual(
len(
Arrays.intersection_two_arrays_ii(nums1=[1, 2, 2, 1],
nums2=[2, 2])), 2)
# nums1 =[3,1,2], nums2 = [1,3], return [1,3]
self.assertEqual(
len(
Arrays.intersection_two_arrays_ii(nums1=[3, 1, 2],
nums2=[1, 3])), 2)
# Test with spaces
# Given nums1 = [1, 2, 2, 1], nums2 = [2, 2], return [2, 2]
self.assertEqual(
len(
Arrays.intersection_two_arrays_ii_with_space(
nums1=[1, 2, 2, 1], nums2=[2, 2])), 2)
# nums1 =[3,1,2], nums2 = [1,3], return [1,3]
self.assertEqual(
len(
Arrays.intersection_two_arrays_ii_with_space(nums1=[3, 1, 2],
nums2=[1, 3])), 2)
def test_find_duplicates(self):
# [4,3,2,7,8,2,3,1] => [2,3]
self.assertListEqual(Arrays.find_duplicates([4, 3, 2, 7, 8, 2, 3, 1]),
[2, 3])
# [2,2] => [2]
self.assertListEqual(Arrays.find_duplicates([2, 2]), [2])
def test_combination_sum(self):
"""
Input: candidates = [2,3,6,7], target = 7,
A solution set is:
[
[7],
[2,2,3]
]
"""
a = Arrays()
unique_combs = a.combination_sum([2, 3, 6, 7], 7)
self.assertListEqual(unique_combs, [[2, 2, 3], [7]])
def test_product_except_self(self):
# Input: [1,2,3,4] => Output: [24,12,8,6]
self.assertListEqual(Arrays.product_except_self([1, 2, 3, 4]),
[24, 12, 8, 6])
# [1,2] => [2,1]
self.assertListEqual(Arrays.product_except_self([1, 2]), [2, 1])
# [1,2,3] => [6,3,2]
self.assertListEqual(Arrays.product_except_self([1, 2, 3]), [6, 3, 2])
# [2,2] => [2,2]
self.assertListEqual(Arrays.product_except_self([2, 2]), [2, 2])
def test_get_longest_unique_substr(self):
# Given "abcabcbb", the answer is "abc", which the length is 3.
self.assertEqual(Arrays.get_longest_unique_substr_down('abcabcbb'), 3)
# Given "bbbbb", the answer is "b", with the length of 1.
self.assertEqual(Arrays.get_longest_unique_substr_down("bbbbb"), 1)
# Given "pwwkew", the answer is "wke", with the length of 3
self.assertEqual(Arrays.get_longest_unique_substr_down("pwwkew"), 3)
# "c" => 0
self.assertEqual(Arrays.get_longest_unique_substr_down("c"), 1)
# "au" => 2
self.assertEqual(Arrays.get_longest_unique_substr_down("au"), 2)
def partition(nums, start, end):
pivot = nums[end]
wall = start - 1 # separate Left (values <= pivot) and Right (values > pivot)
# update nums based on selected pivot
for i in range(start, end):
if nums[i] <= pivot:
# need to move to Left side
# update write index
wall += 1
# move vale < pivot to the left side
Arrays.swap(nums, wall, i)
# update wall
if (nums[wall + 1] > nums[end]):
Arrays.swap(nums, wall + 1, end)
return wall + 1
def test_find_duplicate_num(self):
# Input: [1,3,4,2,2] => Output: 2
self.assertEqual(Arrays.find_duplicate_num([1, 3, 4, 2, 2]), 2)
# Input: [3,1,3,4,2] => Output: 3
self.assertEqual(Arrays.find_duplicate_num([3, 1, 3, 4, 2]), 3)