无表头单链表的总结----无限删除和无限插入(在主函数里实现)

#include"head.h"
int main()
{
    struct Student *head;
    struct Student *addinfo;
    printf("请输入信息（101 wang f s 501）(以“0 0 0 s 0”作为结束标志)：\n");
    head = input();
    print(head);
    char del_num[N];
    printf("请输入要删除的号码(输入0终止删除)：");
    scanf_s("%s", del_num,N);
    head = del(head,del_num);
    print(head);
    while (strcmp(del_num, "0") != 0)             //用while 循环“0”为终止条件
    {
        printf("请输入要删除的号码(输入0终止删除)：");
        scanf_s("%s", del_num, N);
        head = del(head, del_num);                
        print(head);
    }

    printf("请输入要增加的信息(以“0 0 0 s 0”作为结束标志)：\n");
    addinfo = input();
    while (addinfo != NULL)        ////用while 循环“0”为终止条件
    {
        head = insert(head, addinfo);
        print(head);
        printf("请输入要增加的信息(以“0 0 0 s 0”作为结束标志)：\n");
        addinfo = input();
    }
    return 0;
}