| 网站首页 | 业界新闻 | 小组 | 威客 | 人才 | 下载频道 | 博客 | 代码贴 | 在线编程 | 编程论坛
欢迎加入我们,一同切磋技术
用户名:   
 
密 码:  
共有 256 人关注过本帖
标题:请大神们帮忙解决啊 新人改不了
只看楼主 加入收藏
塔吉二
Rank: 1
等 级:新手上路
帖 子:1
专家分:0
注 册:2013-11-17
结帖率:100%
收藏
已结贴  问题点数:20 回复次数:2 
请大神们帮忙解决啊 新人改不了
#include<stdio.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 *p1,*p2;
    struct student *head;
    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);
}
int count(struct student *head)
{
    struct student *p;
    n=0;
    p=head;
    while(p!=NULL)
    {
        n++;
        p=p->next;
    }
    return(n);
}
struct student *sort(struct student *head)
{
    struct student *p;
    int i;
    if(head!=NULL)
        p=head;
    for(i=0;i<n;i++)
    {
        printf("NO.%d:",i+1);
        printf("%ld,%5.1f\n",p->num,p->score);
        p=p->next;
    }
    return(head);
}
long len(struct student *head,int r)
{
    int i;
    struct student *p;
    if(head!=NULL)
        p=head;
    for(i=0;i<r;i++)
    {
        p++;
    }
    printf("%ld",p->num);
    return(p->num);
}
void print(struct student *head)
{
    struct student *p;
    printf("\nNow,these records are:\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 NULL;
    }
    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;
    p1=head;
    p0=stud;
    if(head==NULL)
    {
        head=p0;
        p0->next=NULL;
    }
    else
    {
        while(p1==head)
        {
            head=p0;
            p0->next=p1;
        }
        n=n+1;
    }
    return(head);
}   
void main()
{
    struct student *head,stu;
    long del_num;
    long num;
    int t;
    printf("input records:\n");
    head=creat();
    print(head);
    printf("\nthere are %d records.\n",count(head));
    printf("the sorted records are:\n");
    head=sort(head);
    printf("input the NO.:");
    scanf("%d",&t);
    while(t>n)
    {
        printf("请从新输入:");
        scanf("%d",&t);
    }
    num=len(head,t);
    printf("\ninput the deleted number:");
    scanf("%ld",&del_num);
    head=del(head,del_num);
    print(head);
    printf("\ninput the insreted record:");
    scanf("%ld,%f",&stu.num,&stu.score);
    head=insert(head,&stu);
    print(head);
}
搜索更多相关主题的帖子: include 
2013-11-17 20:56
yuccn
Rank: 16Rank: 16Rank: 16Rank: 16
来 自:何方
等 级:版主
威 望:167
帖 子:6815
专家分:42393
注 册:2010-12-16
收藏
得分:10 
没有看到问题

我行我乐
公众号:逻辑客栈
我的博客:
https://blog.yuccn. net
2013-11-17 23:13
韶志
Rank: 19Rank: 19Rank: 19Rank: 19Rank: 19Rank: 19
来 自:斗气大陆
等 级:贵宾
威 望:44
帖 子:2223
专家分:13592
注 册:2013-3-22
收藏
得分:10 
没有问题...   
你有什么问题说出来啊

三十年河东,三十年河西,莫欺少年穷!
2013-11-17 23:28
快速回复:请大神们帮忙解决啊 新人改不了
数据加载中...
 
   



关于我们 | 广告合作 | 编程中国 | 清除Cookies | TOP | 手机版

编程中国 版权所有,并保留所有权利。
Powered by Discuz, Processed in 0.021216 second(s), 8 queries.
Copyright©2004-2024, BCCN.NET, All Rights Reserved