链表

参靠浙江大学翁凯老师的链表

#include <stdio.h> 
#include <stdlib.h>
typedef struct _node
{
    int value;
    struct _node *next;
} Link;
typedef struct
{
    Link *head; 
    // Link *tail;
} List;//
void add(List *pList, int num);
void print(List list);

int main(int argc, char const *argv[])
{
    int num;
    List list;
    list.head = NULL;
    do{
        scanf("%d", &num);
        if(num != -1){
            add(&list, num);//add
            printf("list=%x\n", list);
        }
    }while(num != -1);
//输出
    print(list);
//delete
    printf("delete\n");
    scanf("%d", &num);
    Link *p;
    int isFound = 1;
    for(p=list.head; p; p=p->next){
        if(p->value == num) {
            printf("look!\n");
            isFound = 0;
            Link *q=NULL;
            for(p=list.head; p; q=p, p=p->next){
                if( p->value == num ) {
                    if( q ){
                        q->next = p->next;
                    } else {
                        list.head = p->next;
                    }
                    free(p);
                    break;
                }
            }
            printf("delete after:\n");
            print(list);
            break;
        }
    }
        if( isFound ) {
            printf("Not!");
        }
//remove:
    Link *q=NULL;
    for( p=list.head; p; p=q){
        q = p->next;
        free(p);
    }
    printf("over!\n");

    return 0;
}

void add(List *pList, int num){
    //add to linked-list
    Link* p=(Link*)malloc(sizeof(Link));
            p->value = num;
            p->next = NULL;
            //find head
            Link* last = pList->head;//pHead->Link*
            printf("last=%x\n", last);
            if(last){
                while(last->next){
                    last = last->next;
                    printf("last=%x\n", last);
                }
                //attach
                last->next = p;
            } else{
            pList->head = p;
            }
//          return head;
}
void print(List list){
//遍历链表
    Link* p;
    for (p=list.head; p; p=p->next){
        printf("%d\t", p->value);
    }
    printf("\n");
}