#include < stdio.h >
#include < stdlib.h >
#include < malloc.h >
#define NULL 0
#define LEN sizeof ( struct student )
struct student
{
    long num;
    float score;
    struct student *next;
};
int n;

struct student *creat ( void )
{
    struct student *head;
    struct student *p1, *p2;
    n = 0;
    p1 = p2 = ( struct student* ) malloc ( LEN );
    scanf ( "%ld, %f", &p1->num, &p1->score );
    head = NULL;
    while ( p1->num != 0 )
    {
        n = n + 1;
        if ( n == 1 )
            head = p1;
        else p2->next = p1;
        p2 = p1;
        p1 = ( struct student* )malloc ( LEN );
        scanf ( "%ld,%f", &p1->num, &p1->score );
    }
    p2->next = NULL;
    return(head);
}

void print ( struct student *head )
{
    struct student *p;
    printf ( "\nNow, These %d records are:\n", n );
    p = head;
    if ( head != NULL )
        do
        {
            printf ( "%ld %5.1f\n", p->num, p->score );
            p = p->next;
        }
        while ( p!= NULL );
}

struct student *del ( struct student *head, long num )
{
    struct student *p1, *p2;
    if ( head == NULL )
    {
        printf ( "\nlist null! \n" );
        return head;
    }
    p1 = head;
    while ( num != p1->num && p1->next != NULL )
    {
        p2 = p1;
        p1 = p1->next;
    }
    if ( num == p1->num )
    {
        if ( p1 ==head )
            head = p1->next;
        else
            p2->next = p1->next;
        printf ( "delete:%ld\n", num );
        n = n -1;
    }
    else
        printf ( "%ld not been found! \n", num );
    return ( head );
}

struct student *insert ( struct student *head, struct student *stud )
{
    struct student *p0, *p1, *p2;
    p1 = head;
    p0 = stud;
    if ( head == NULL )
    {
        head = p0;
        p0->next = NULL;
    }
    else
    {
        while ( ( p0->num > p1->num ) && ( p1->next != NULL ) )
        {
            p2 = p1;
            p1 = p1->next;
        }
        if ( p0->num > p1->num )
        {
            if ( head == p1 )
                head = p0;
            else
                p2 ->next = p0;
            p0->next = p1;
        }
        else
        {
            p1->next = p0;
            p0->next = NULL;
        }
    }
    n = n + 1;
        return ( head );
}



    void main ( )
    {
        struct student *head, stu;
        long del_num;
        printf ( "input records:\n" );
        head = creat ( );
        print ( head );
        printf ("\ninput the deleted number:" );
        scanf ( "%ld",&del_num );
        head = del ( head, del_num );
        print ( head );
        printf ( "\ninput the inserted record: " );
        scanf ( "%ld,%f", &stu.num, &stu.score );
        head = insert ( head, &stu );
        print ( head );
        system ( "pause" );
    }

坐一下沙法。。有什么学习心得么？

我可以问个事情吗？ 楼主 你写的 代码 没有 注解 别人 怎么看？~
如果可以的话 真的可以 加上 注解 的 别人 看着 不用去 猜想 你的意思 简单 不是 很好嘛？~

看倒是看懂啦，就是自己写的时候总是很纠结，感觉无处下手啊，，，有何学习心得交流一下呗

少来了，你比我厉害吧。。。。

还行啦，编程风格还不错啊，而且函数也用得不错！
但是好像是书本上的代码吧？？？

没有总结，哪里有提高呀？
再说了，我比你厉害？臆想？
不会的，你和我都一样，没有高手和低手之分，只有资料的多寡，闻道的先后之差，不必看低自己，你不比别人差多少。

其实

链表而已。。 有必要晒吗？

我又没有说是我写的，真是的。。。。我刚看完链表，我可写不出来，，，

你的话每回都很有深度，值得学习，不过我还是觉得你谦虚了。。。。。。。。。。