这是道老题。通常的方法是用两个pointers 从头到尾过两个arrays。复杂度是O(n).
但是如果一个array要比另一个大很多,则我们要Binary Search.复杂度是O(nlgm)。
扩展题是,在下面的情况下,how to optimize the search process (we may need to
switch between O(n) and O(nlgm) methods),
case 1:
v1: 1, 100, ......, 200,300,......,400
v2: 1,......, 100, 200, ......,300,400
case 2:
v1: 1,3,4,7,......,1M+1
v2: 2,4,6,8,...... 1M
case 3:
v1: 1,300, 5000, 70000, ......,1M+1
v2: 2,400, 6000, 80000, ......, 1M
求告人指点。