栈合并代码（两套代码）

1.

Status Combine(LinkList& L, LinkList& K, LinkList& J)
{
    LinkList j;
    if (!L->next && !K->next)return ERROR;
    J = L;
    j = L;
    L = L->next;
    K = K->next;

    while(L&& K)
    {
        
        if(L->date<K->date)
        {
            j->next = L;
            j = j->next;
            L = L->next;
            continue;
        }
        if (L->date > K->date)
        {
            j->next = K;
            j = j->next;
            K = K->next;
            continue;
        }
        if (L->date == K->date)
        {
            j->next = L;
            j = L;
            L = L->next;
            K = K->next;
            continue;
        }
    }
    j->next = L ? L : K;
     
    return OK;
}

2.

Status FindDuplications(LinkList& L, LinkList& K)
{
    if (!L->next || !K->next)return ERROR;
    LinkList l, k, j;
    l = L->next;
    j = L;
    k = K->next;
    while (l->next && k->next)
    {
        if (l->date < k->date)
        {
            l = l->next;
        }
        if (l->date > k->date)
        {
            k = k->next;
        }
        if (l->date == k->date)
        {
            j->next = l;
            j = l;
            l = l->next;
            k = k->next;
            j->next = NULL;
        }
    }
    printfl(L);
    return OK;
}