单链表

LInkList

Insert 插入

void addToHead(int el) {
   if (tail != 0) {      // 如果链表不为空
         tail->next = new IntSLLNode(el);
         tail = tail->next;
    }
    //向空链表插入
    else head = tail = new IntSLLNode(el);
}

Find 查找

bool isInList(int el) {
    IntSLLNode *tmp;
    for (tmp = head; tmp != 0 && !(tmp->info == el); tmp = tmp->next);
    return tmp != 0;
}

**Delete 删除

void deleteNode(int el) {
    if (head != 0){                     // 如果链表不为空
         if (head == tail && el == head->info) { // 如果链表只有一个结点
              delete head;                       
              head = tail = 0;
         }
         else if (el == head->info) {  // 删除头结点
              IntSLLNode *tmp = head;
              head = head->next;
              delete tmp;              // 删除原头结点
         }
         else {    // 如果链表不只一个结点
              IntSLLNode *pred, *tmp;
              for (pred = head, tmp = head->next; tmp != 0 && !(tmp->info == el);pred = pred->next, tmp = tmp->next);//要删除的结点不是头结点
              if (tmp != 0) 
                   pred->next = tmp->next;
              if (tmp == tail)
                   tail = pred;
              delete tmp;
         }
    }
} 

**Merge 合并

//有序带头结点的链表合并
void   MergeList_L (LinkList &La，LinkList &Lb，LinkList &Lc) {
    IntSLLNode *pa = La->link ; 
    IntSLLNode *pb = Lb->link ;//分别指向第一个结点
    IntSLLNode *pc;
    Lc = pc = La ;
    while  ( pa && pb )  {
        if  ( pa->data <= pb->data )   {
            pc->link = pa ;
            pc = pa ;
            pa = pa->link;
        }
        else  {  
            pc->link = pb ;
            pc = pb ;
            pb = pb->link ;
        } 
    }
    pc->link = pa ? pa : pb ;//处理剩余部分
    delete  Lb ;
}