69,371
社区成员
发帖
与我相关
我的任务
分享
#pragma warning(disable:4996)
#include <stdio.h>
#include <stdlib.h>
#define LEN sizeof(struct Student)
struct Student
{
int num;
float score;
struct Student *next;
};
int main()
{
struct Student *creat();
void hebin(struct Student *p1, struct Student *p2);
void sort(struct Student *yuan);
void input(struct Student *p);
struct Student *a, *b;
printf("输入a链表数据:\n");
a = creat();
printf("输入b链表数据:\n");
b = creat();
hebin(a, b);
sort(a);
input(a);
return 0;
}
struct Student *creat()
{
struct Student *head=NULL,*p1,*p2;
int i = 0;
p1 = (struct Student *)malloc(LEN);
scanf("%d%f", &p1->num, &p1->score);
if (p1->num != 0)
{
head = p1, p2 = p1;
do
{
p2->next = p1;
p2 = p1;
p1 = (struct Student *)malloc(LEN);
scanf("%d%f", &p1->num, &p1->score);
} while (p1->num != 0);
p2->next = NULL;
}
free(p1);
return head;
}
void hebin(struct Student *p1, struct Student *p2)//把p2链接到p1尾部
{
while (p1->next != NULL)
{
p1 = p1->next;
}
p1->next = p2;
}
void sort(struct Student *yuan)//按学号升序排列
{
struct Student *p = yuan, *k,*t;
struct Student temp;
int len = 1;//链表的长度
while (p->next != NULL)
{
p = p->next;
len++;
}
for (int i = 0; i < len - 1; i++)
{
p = yuan;
for (int j = 0; j < i; j++)
p = p->next;
k = t = p;
for (int j = i + 1; j < len; j++)
{
p = p->next;//错误出在这里 提示“0x012A180F 处有未经处理的异常(在 10.exe 中): 0xC0000005: 读取位置 0x00000008 时发生访问冲突。”
if (p->num < k->num)
{
k = p;
}
}
temp = *t;
*t = *k;
*k = temp;
}
}
void input(struct Student *p)
{
printf("学号: 成绩: \n");
while (p->next != NULL)
{
printf("%-10d%-10.2f\n", p->num, p->score);
p++;
}
printf("%-10d%-10.2f\n", p->num, p->score);
}
temp = *t;
*t = *k;
*k = temp;
改为
temp.num = t->num;
t->num = k->num;
k->num = temp.num;
temp.score = t->score;
t->score = k->score;
k->score = temp.score;
就行了[/quote]
楼主,这两个有什么区别吗?求指教!!!//假设带表头结点的单向链表头指针为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,m;
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;
}
//将单链表中前 m 个结点和后 n 个结点进行互换,m+n为链表总长10
m=4;
n=6;
k=0;
p=head;
while (1) {
if (NULL==p) {
break;
}
k++;
if (m+1==k) {
q=p;
}
s=p;
p=p->next;
}
s1=head->next;
head->next=q->next;
s->next=s1;
q->next=NULL;
//输出整个单链表
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;
}
//18->94->58->17->27->20->43->57->75->78->
//18->94->05->58->17->27->20->43->57->75->78->
//18->94->05->58->27->20->43->57->75->78->
//05->18->20->27->43->57->58->75->78->94->
//43->57->58->75->78->94->05->18->20->27->
//
temp = *t;
*t = *k;
*k = temp;
改为
temp.num = t->num;
t->num = k->num;
k->num = temp.num;
temp.score = t->score;
t->score = k->score;
k->score = temp.score;
就行了