博客
关于我
两个递增有序链表合并成递减排序
阅读量:317 次
发布时间:2019-03-04

本文共 1044 字,大约阅读时间需要 3 分钟。

1.注意临时指针还是用来保存指针值,不要用来指结点

#include 
#include
typedef struct LNode{ int data; struct LNode* next;}LNode,*LinkList;LinkList CreateList(){ LinkList L; L = (LinkList)malloc(sizeof(LNode)); L->next = NULL; LNode *q = L; LNode *p; int x; scanf("%d",&x); while(x != 999) { p = (struct LNode *)malloc(sizeof(LNode)); p->data = x; p->next = NULL; q->next = p; q = p; scanf("%d",&x); } return L;}void main(){ LinkList a = (LinkList)malloc(sizeof(LNode)); LinkList b = (LinkList)malloc(sizeof(LNode)); a = CreateList(); b = CreateList(); LinkList c = (LinkList)malloc(sizeof(LNode)); c->next = NULL; LNode *p = a->next; LNode *q = b->next; LNode *y; while(p != NULL && q != NULL) { if(p->data <= q->data) { y = p->next; p->next = c->next; c->next = p; p = y; } if(p->data > q->data) { y = q->next; q->next = c->next; c->next = q; q = y; } } //ex if(q) p = q; while(p != NULL) { y = p->next; p->next = c->next; c->next = p; p = y; } y = c->next; while(y != NULL) { printf("%d ",y->data); y = y->next; }}

 

转载地址:http://wxiq.baihongyu.com/

你可能感兴趣的文章
mysql 5.6 修改端口_mysql5.6.24怎么修改端口号
查看>>
MySQL 8.0 恢复孤立文件每表ibd文件
查看>>
MySQL 8.0开始Group by不再排序
查看>>
mysql ansi nulls_SET ANSI_NULLS ON SET QUOTED_IDENTIFIER ON 什么意思
查看>>
multi swiper bug solution
查看>>
MySQL Binlog 日志监听与 Spring 集成实战
查看>>
MySQL binlog三种模式
查看>>
multi-angle cosine and sines
查看>>
Mysql Can't connect to MySQL server
查看>>
mysql case when 乱码_Mysql CASE WHEN 用法
查看>>
Multicast1
查看>>
mysql client library_MySQL数据库之zabbix3.x安装出现“configure: error: Not found mysqlclient library”的解决办法...
查看>>
MySQL Cluster 7.0.36 发布
查看>>
Multimodal Unsupervised Image-to-Image Translation多通道无监督图像翻译
查看>>
MySQL Cluster与MGR集群实战
查看>>
multipart/form-data与application/octet-stream的区别、application/x-www-form-urlencoded
查看>>
mysql cmake 报错,MySQL云服务器应用及cmake报错解决办法
查看>>
Multiple websites on single instance of IIS
查看>>
mysql CONCAT()函数拼接有NULL
查看>>
multiprocessing.Manager 嵌套共享对象不适用于队列
查看>>