Слияние сортированных списков с удалением дубликатов

list1 = [1, 3, 5, 7, 9]
list2 = [2, 4, 5, 6, 8, 10]
merged = merge_sorted_lists(list1, list2)
print(merged)

def merge(list1,list2):
    res=[]
    sz1=len(list1)
    sz2=len(list2)
    i1=0
    i2=0
    sz=0
    while True:
        if i1>=sz1:
            for i in range(i2,sz2):
                a=list2[i]
                if sz==0 or res[-1] != a:
                    res.append(a)
                    sz+=1
            return res
        if i2>=sz2:
            for i in range(i1,sz1):
                a=list1[i]
                if sz==0 or res[-1] != a:
                    res.append(a)
                    sz+=1
            return res
        a=list1[i1]
        b=list2[i2]
        if a<b:
            if sz==0 or res[-1] != a:
                res.append(a)
                sz+=1
            i1+=1
        if b<a:
            if sz==0 or res[-1] != b:
                res.append(b)
                sz+=1
            i2+=1
        if a==b:
            if sz==0 or res[-1] != b:
                res.append(b)
                sz+=1
            i2+=1
            i1+=1
            
x1=[1,1,2,2,4,5,5,5,6,6,7,8,9]
x2=[-1,-1,0,0,1,2,3,7,8,9,9,9]
 
x=merge(x1,x2)
 
print(x)

list1 = [1, 3, 5, 7, 9]
list2 = [2, 4, 5, 6, 8, 10]
merged = sorted(list(set(list1 + list2)))
print(merged)

def move(a, b ,arr_A, arr_B, res):
    while a < len(arr_A) and (b == len(arr_B) or arr_A[a] <= arr_B[b]):
        if not res or res[-1] != arr_A[a]:
            res.append(arr_A[a])
        a += 1
    return a
 
def merge_sorted_lists(arr_A, arr_B):
    a = b = 0
    res = []
    while not res or res[-1] != max(arr_A[-1], arr_B[-1]):
        a = move(a, b ,arr_A, arr_B, res)
        b = move(b, a ,arr_B, arr_A, res)
    return res
 
A = [1,1,2,2,4,5,5,5,6,6,7,8,9,110,200,310,1000]
B = [-1,-1,0,0,1,7,8,9,9,9,100,210,300,2000]
res = merge_sorted_lists(A, B)
print(res)

from heapq import merge
 
 
def merge_sorted_lists(list1, list2):
    merged = merge(list1, list2)
    result = []
    for x in merged:
        if result and result[-1] != x or not result:
            result.append(x)
    return result
    
list1 = [1, 3, 5, 7, 9]
list2 = [2, 4, 5, 6, 8, 10]
merged = merge_sorted_lists(list1, list2)
print(merged)  # [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]

from heapq import merge
from itertools import groupby 
    
def merge_sorted_lists(list1, list2):
    return list(map(lambda x: x[0], groupby(merge(list1, list2))))
    
list1 = [1, 3, 5, 7, 9]
list2 = [2, 4, 5, 6, 8, 10]
merged = merge_sorted_lists(list1, list2)
print(merged)  # [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]

from heapq import merge
from itertools import groupby 
    
 
def merge_sorted_lists(list1, list2):
    return [x for x, _ in groupby(merge(list1, list2))]
 
    
list1 = [1, 3, 5, 7, 9]
list2 = [2, 4, 5, 6, 8, 10]
merged = merge_sorted_lists(list1, list2)
print(merged)  # [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]