python返回两个有序数组的交集

[kernelkoder]

python返回两个有序数组的交集
Write a program which takes as hput two sorted arrays, and returns a new array containing
elements that are present in both of the input arrays. The input arrays may have duplicate entries,
but the returned array should be free of duplicates. For example, the input is <2,3,3,5,5,6,7,7,8,12>
and (5,5,6,8 ,8,9,70,10), your output should be (5, 6, 8).
Hinf: Solve the problem if the input array lengths diffur by orders of magnitude. What if they are approximately
equal?
Solution: The brute-force algorithm is a "loop join" , i.e., traversing through all the elements of one
array and comparing them to the elements of the other array. Letm and n be the lengths of the two
input arrays

def intersect-two-sorted-arrays (A, B) :
return [a for i, a in enumerate(A)if (i== 0 or a != A[i - 1]) and a in B]
-----------
上面这个i==0是什么含义?

[cool_sql_9]

i==0是对A数组中第一个数做的特殊处理，因为对第一个数，没法进行a != A[i - 1]的比较

[chuifengde]

如果A改一下示例为：<2,3,3,5,5,6,7,7,8,12,9,8>那结果是多少？

[weixin_45903952]

i==0时，A[i-1]下标越界

[cool_sql_9]

引用 2 楼 chuifengde 的回复:

如果A改一下示例为：<2,3,3,5,5,6,7,7,8,12,9,8>那结果是多少？

楼主的问题中A是有序数组吧 如果不是 就先排序

[kernelkoder]

感谢各位指点