数据结构oj

template<class ElemType>
void Delete_Equal_Node( LinkList<ElemType> &A, int N )
{
    int *arr = new int[N+1];
    for(int i = 0; i < N; ++i)
        arr[i] = 0;
    LinkNode<ElemType> *p = A.GetHead()->next, *t;
    int pos = 0;
    while(p)
    {
        p = p->next;
    }
    p = A.GetHead()->next;
    while(p)
    {
        if(!arr[abs(p->data)])
        {
            arr[abs(p->data)] = 1;
            t = p;
            pos++;

        }else
        {
            p = t;
            A.ListDelete(pos+1);
        }
        p = p->next;

    }
}

void Merge_L_Order( LinkList<ElemType> &A, LinkList<ElemType> &B )
{
    LinkNode<ElemType> *pa = A.GetHead()->next, *pb = B.GetHead()->next, *t1=A.GetHead(), *t2;
    int pos = 1;
    while(pa)
    {
        if(!pb)
            break;
        if(pb->data < pa->data)
        {

            t2 = pb->next;
            A.ListInsertNode(t1, pb);
            pa = pb;
            pb = t2;

        }else if(pb->data == pa->data)
        {
            t2 = pb->next;
            delete pb;
            pb = t2;
        }else
        {
            pos ++;
            t1 = pa;
            pa = pa->next;
        }
    }
    if(pb)
        A.GetTail()->next = pb;
    while(pb && pb->next)
    {
        if(pb->next->data == pb->data)
        {
            t1 = pb->next;
            pb->next = t1->next;
            delete t1;
        }else
        {
            pb = pb->next;
        }
    }
    if(pb)
        A.SetTail(pb);
    delete B.GetHead();
    B.GetTail()->next = NULL;
}