关于链表操作的一些有关问题

2013-07-08

关于链表操作的一些问题[aligncenter]# include stdio.h# include malloc.htypedef struct student{l

关于链表操作的一些问题
[align=center]

# include <stdio.h>
# include <malloc.h>
typedef struct student{
long num;/*学号*/
char name[10];
char sex;
float score;/*分数*/
struct student * pNext;
}STU,* PSTU;
void creat(PSTU *);
PSTU create_list(void);
int length_list(PSTU pHead);
void sort_list(PSTU);
void insert_list(PSTU);
void traverse_list(PSTU);
void find_del_list(PSTU);

int main(void)
{
PSTU pHead;
pHead = create_list();/*建立一个链表*/
        sort_list(pHead);/*对链表进行排序*/
insert_list(pHead);/*新建一个链表，并插入到原链表*/
traverse_list(pHead);/*打印链表*/
find_del_list(pHead);/*找到一个学生的学号，查找到则删除那个节点*/
free(pHead);
return 0;
}
PSTU create_list(void)
{
int i,len;
PSTU pHead,pTail,pNew;
pHead = (PSTU)malloc(sizeof(STU));
        pTail = (PSTU)malloc(sizeof(STU));
pHead->pNext = pTail;
printf("input how long you want:\n");/*确定需要几个节点*/
scanf("%d",&len);
for ( i = 0; i < len ; i++)
{
printf("input the number,name,sex,score:");
scanf("%ld %s %c %f",&pTail->num,&pTail->name,&pTail->sex,&pTail->score);
pNew = (PSTU)malloc(sizeof(STU));
pTail->pNext = pNew;
pNew->pNext = NULL;
pTail = pNew;
}
return pHead;

}
int length_list(PSTU pHead{
PSTU p = pHead->pNext;
int len = 0;

while (NULL != p)
{
++len;
p = p->pNext;
}

return len;
}
void sort_list(PSTU pHead)
{
int i ,j;
float t;
int len = length_list(pHead);
PSTU p, q;
for (i=0,p=pHead->pNext; i<len-1; ++i,p=p->pNext)
{

for (j=i+1,q=p->pNext; j<len; ++j,q=q->pNext)
{
if (p->score > q->score)
{
t = p->score;
p->score = q->score;
q->score = t;
}
}
}
}
void insert_list(PSTU pHead)
{

PSTU pre,q,b;
pre = (PSTU)malloc(sizeof(STU));
q = pHead->pNext;
b = q->pNext;
        printf("input the new message\n");

printf("input the number,name,sex,score:");
scanf("%ld %s %c %f",pre->num,pre->name,pre->sex,pre->score);
while (q->pNext != NULL)
{
if ( pre->score > q->score && pre->score < b->score)
{
pre->pNext = q->pNext;
q->pNext = pre;
}
q = q->pNext;
}

}
void traverse_list(PSTU pHead)
{
PSTU p;
p = pHead->pNext;
while (p->pNext != NULL)
{
printf("%ld\t%s\t%c\t%.2f\n",p->num,p->name,p->sex,p->score);
p = p->pNext;
}
}
void find_del_list(PSTU pHead)
{
long n;
PSTU q,p;
p = pHead;
printf("input what you want find:\n");
scanf("%ld",&n);
while ( p->pNext != NULL)
{
q = p;
if (p->num == n)
{
printf("find it\n");
q->pNext = p->pNext;
}
p = p->pNext;
}
}
[/align]
关于链表操作的一些有关问题
这是运行的结果。我感觉是在插入那里出问题。希望各位大神看看，帮我分析一下，谢谢！
再附个小问题：C语言的基本语法已经学完了，接下来我应该学什么？谢谢大家！链表 C
[解决办法]
程序木有时间看了，，接下来学面向对象，，如果你想搞开发的话
[解决办法]
scanf("%ld %s %c %f",&pTail->num,&pTail->name,&pTail->sex,&pTail->score);
scanf("%ld %s %c %f",pre->num,pre->name,pre->sex,pre->score);
为毛两句话不一样？是这个问题吧
[解决办法]
你的create_list也有问题吧，如果输入长度len为1，你在create_list开始申请了一头一尾，然后len=1,你又申请了一个空间，如果按照你写的代码，要返回链表长度的话，应该是2吧，而其实你的本意是长度为1
[解决办法]

PSTU create_list(void)
{
int i,len;
PSTU pHead,pTail,pNew;
pHead = (PSTU)malloc(sizeof(STU));

pTail = pHead;
pTail->pNext = NULL; 
 

printf("input how long you want:\n");
scanf("%d",&len);
for ( i = 0; i < len ; i++)
{
pNew = (PSTU)malloc(sizeof(STU));
printf("input the number,name,sex,score:");
scanf("%ld %s %c %f",&pNew->num,&pNew->name,&pNew->sex,&pNew->score);
pTail->pNext = pNew;
pNew->pNext = NULL;
pTail = pNew;
}
return pHead;

}

void traverse_list(PSTU pHead)
{
PSTU p;
p = pHead->pNext;
while (p != NULL)
{
printf("%ld\t%s\t%c\t%.2f\n",p->num,p->name,p->sex,p->score);
p = p->pNext;
}
}

目前只改了create和traverse里的。在main里注释掉insert和find，功能OK。你比对了看看。
[解决办法]

//假设带表头结点的单向链表头指针为head，试编写一个算法将值为5的结点插入到连接表的第k个结点前，删除第k个节点，并对该链表进行排序。
#include <stdio.h>
#include <stdlib.h>
#include <malloc.h>
#include <time.h>
struct NODE {
    int          data;
    struct NODE *next;
} H,*head,*p,*q,*s1,*s2,*s3,*s4,*s;
int i,j,k,n,t;
int main() {
    srand(time(NULL));

    //填写头节点数据
    H.data=-1;
    H.next=NULL;
    head=&H;

    //创建10个节点的单链表
    p=head;
    for (i=0;i<10;i++) {
        q=(struct NODE *)malloc(sizeof(struct NODE));
        if (NULL==q) return 1;
        q->data=rand()%100;//填写0..99的随机值
        q->next=NULL;
        p->next=q;
        p=q;
    }

    //输出整个单链表
    s=head->next;
    while (1) {
        if (NULL==s) {
            printf("\n");
            break;
        }
        printf("%02d->",s->data);
        s=s->next; 
 
    }

    //将值为5的结点插入到单链表的第k个结点前
    k=3;
    n=0;
    p=head;
    while (1) {
        if (NULL==p) {
            break;
        }
        n++;
        if (k==n) {
            q=(struct NODE *)malloc(sizeof(struct NODE));
            if (NULL==q) return 1;
            q->data=5;
            q->next=p->next;
            p->next=q;
            break;
        }
        p=p->next;
    }

    //输出整个单链表
    s=head->next;
    while (1) {
        if (NULL==s) {
            printf("\n");
            break;
        }
        printf("%02d->",s->data);
        s=s->next;
    }

    //删除第k个节点
    k=5;
    n=0;
    p=head;
    while (1) {
        if (NULL==p) {
            break;
        }
        n++;
        if (k==n) {
            q=p->next;
            if (q) {
                p->next=q->next;
                free(q);
            } 
 
            break;
        }
        p=p->next;
    }

    //输出整个单链表
    s=head->next;
    while (1) {
        if (NULL==s) {
            printf("\n");
            break;
        }
        printf("%02d->",s->data);
        s=s->next;
    }

    //从小到大排序
    for (p=head;p!=NULL && p->next!=NULL;p=p->next) {
        for (q=p->next;q!=NULL && q->next!=NULL;q=q->next) {
            if (p->next->data > q->next->data) {

                //交换data
//              printf("swap %02d %02d\n",p->next->data,q->next->data);
//              t=p->next->data;p->next->data=q->next->data;q->next->data=t;

                //或者

                //交换next
//              printf("swap %02d %02d\n",p->next->data,q->next->data);
                s1=p->next;
                s2=p->next->next;
                s3=q->next;
                s4=q->next->next;

                if (s2!=s3) {
                     p->next=s3;
                    s3->next=s2; 
 
                     q->next=s1;
                    s1->next=s4;
                } else {
                     p->next=s3;
                    s3->next=s1;
                           q=s3;
                    s1->next=s4;
                }

                //输出整个单链表
//              s=head->next;
//              while (1) {
//                  if (NULL==s) {
//                      printf("\n");
//                      break;
//                  }
//                  printf("%02d->",s->data);
//                  s=s->next;
//              }
//              getchar();
            }
        }
    }

    //输出整个单链表
    s=head->next;
    while (1) {
        if (NULL==s) {
            printf("\n");
            break;
        } 
 
        printf("%02d->",s->data);
        s=s->next;
    }

    //释放所有节点
    p=head->next;
    while (1) {
        if (NULL==p) {
            break;
        }
        q=p->next;
        free(p);
        p=q;
    }

    return 0;
}
//29->82->10->22->71->05->13->60->59->39->
//29->82->05->10->22->71->05->13->60->59->39->
//29->82->05->10->71->05->13->60->59->39->
//05->05->10->13->29->39->59->60->71->82->
//

热点排行