Question

Suppose we are given two n-element sorted sequences A and B that may contain duplicate entries. Describe an O(n)-time method for computing a sequence representing all elements in A or B with no duplicates.（python）

Answer 1

https://onlinegdb.com/r11tcnkf8

def printUnion(arr1, arr2, m, n):
i,j = 0,0
while i < m and j < n:
if arr1[i] < arr2[j]:
print(arr1[i])
i += 1
elif arr2[j] < arr1[i]:
print(arr2[j])
j+= 1
else:
print(arr2[j])
j += 1
i += 1
  
# Print remaining elements of the larger array
while i < m:
print(arr1[i])
i += 1
  
while j < n:
print(arr2[j])
j += 1
  
# Driver program to test above function
arr1 = [1, 2, 4, 5, 6]
arr2 = [2, 3, 5, 7]
m = len(arr1)
n = len(arr2)
printUnion(arr1, arr2, m, n)