链表
关注
分享
扫一扫
small菜鸟的博客
公众号【程序猿的生活杂货铺】,记录菜鸟的日常生活和吐槽,欢迎关注！
展开
-
单链表的拆分
#include#includestruct node{ int data; struct node *next;};struct node *creat(int n){ struct node *head,*p,*tail; head=(struct node *)malloc(sizeof(struct node)); head->next=NULL原创 2016-10-09 10:24:54 · 409 阅读 · 0 评论 -
顺序建立链表
#include#includestruct node{ int data; struct node *next;};struct node *creat(int n){ struct node *head,*tail,*p; head=(struct node *)malloc(sizeof(struct node)); head->next=原创 2016-10-02 15:03:29 · 374 阅读 · 0 评论 -
逆序建立链表
#include#includestruct node{ int data; struct node *next;};struct node *creat(int n){ struct node *head,*tail,*p; head=(struct node *)malloc(sizeof(struct node)); head->next=原创 2016-10-02 15:09:16 · 376 阅读 · 0 评论 -
逆置链表
#include#includestruct node{ int data; struct node *next;};struct node *creat(){ struct node *head,*tail,*p; head=(struct node *)malloc(sizeof(struct node)); head->next=NULL;原创 2016-10-02 15:28:44 · 282 阅读 · 0 评论