链表
关注
分享
扫一扫
李总LKC
这个作者很懒，什么都没留下…
展开
-
带头结点链表的实现
#includeusing namespace std;typedef struct head{ int a; struct head *next;}NLode;void intial(NLode **head){ *head=(NLode *)malloc(sizeof(NLode)); (*head)->next=NULL;}void insert(NLode原创 2014-08-27 00:27:27 · 488 阅读 · 0 评论 -
2个有序链表的合并
#includeusing namespace std;typedef struct head{ int a; struct head *next;}NLode;void intial(NLode **head){ *head=(NLode *)malloc(sizeof(NLode)); (*head)->next=NULL;}void insert(NLode原创 2014-08-27 00:30:57 · 444 阅读 · 0 评论 -
链表的冒泡排序
#includeusing namespace std;typedef struct head{ int a; struct head *next;}NLode;void intial(NLode **head){ *head=(NLode *)malloc(sizeof(NLode)); (*head)->next=NULL;}void insert(NLode原创 2014-08-27 00:51:48 · 477 阅读 · 0 评论 -
链表翻转
#includeusing namespace std;typedef struct head{ int a; struct head *next;}NLode;void intial(NLode **head){ *head=(NLode *)malloc(sizeof(NLode)); (*head)->next=NULL;}void insert(NLode原创 2014-08-27 00:36:21 · 459 阅读 · 0 评论