2013年9月25日

行编辑行器

摘要： # include # include struct node { char a[300]; int top; }p; int main() { char s[1000]; int i,j,k,n; while(gets(s) != NULL) { p.top=0; n=strlen(s); fo... 阅读全文

posted @ 2013-09-25 18:25 随风浪子的博客 阅读(140) 评论(0) 推荐(0)

单链表中重复元素的删除

摘要： # include # include # include typedef struct node { struct node *next; int data; int num; }LINK; int main() { int n,i,j,k=0; LINK *p,*head,*q; head=(LINK *)malloc(sizeof(LI... 阅读全文

posted @ 2013-09-25 18:15 随风浪子的博客 阅读(143) 评论(0) 推荐(0)

链表归并

摘要： # include # include # include typedef struct node { struct node *next; int data; }LINK; LINK *merge(LINK *head1,LINK *head2); int main() { int i,n,m; LINK *q,*p,*head,*head1,*head2... 阅读全文

posted @ 2013-09-25 18:13 随风浪子的博客 阅读(126) 评论(0) 推荐(0)

链表逆置

摘要： # include # include # include typedef struct node { struct node *next; int data; }LINK; int main() { int i,j,n,leag=0; LINK *p,*q,*head; head=(LINK *)malloc(sizeof(LINK)); ... 阅读全文

posted @ 2013-09-25 18:12 随风浪子的博客 阅读(88) 评论(0) 推荐(0)

链表的逆序 顺序建立

摘要： # include # include # include typedef struct node { struct node *next; int data; }LINK; int main() { int i,j,n,leag=0; LINK *p,*head,*tail; head=(LINK *)malloc(sizeof(LINK)); ... 阅读全文

posted @ 2013-09-25 18:09 随风浪子的博客 阅读(110) 评论(0) 推荐(0)

导航