数据结构的学习与练习

    int List::Remove(int i)
    {
    LinkNode *del, *current = first->link;
    int k = 1;
    if(k == 1){
        del = first->link;
        first->link = del->link;
        delete del;
        return 1;
    }
    while(k < i-1)
    {
        if(current == NULL)
            break;
        else
            current = current->link;
        k++;
    }
    if(current == NULL || current->link == NULL)
    {
        cout << "链表太短";
        return 0;
    }
    del = current->link;
    current->link = del->link;
    delete del;
    return 1;