未完成
冬至圣诞
这个作者很懒,什么都没留下…
展开
-
2021-10-20inversion
void inversion(linklist *head) { linklist *p,*q; p=head->next; head->next=NULL; while(head!=NULL) { q=p; p=p->next; q->next=head->next; head->next=q; } }原创 2021-10-20 17:28:30 · 73 阅读 · 0 评论 -
20211013
#include<stdio.h> #include<stdlib.h> #include<malloc.h> #define IS 4 typedef struct integer { int number; struct integer *next; }linklist; int S,N;//序号 buidsert(linklist *head) { linklist *p=head; int i; for(i=1;i<=N;i++) { sc.原创 2021-10-13 17:34:22 · 71 阅读 · 0 评论 -
2021-09-22
#include<stdio.h> #include<stdlib.h> #include<malloc.h> #define IS 4 typedef struct integer { int number; struct integer *next; }linklist; buidsert(linklist *head,int n) { linklist *p=head; int i,N=n; for(i=1;i++;i<=N) { scanf.原创 2021-09-22 17:57:30 · 74 阅读 · 0 评论 -
2021-09-15
#include<stdio.h> #include<malloc.h> #define IS 4 typedef struct integer { int number; struct integer *next; }linklist; linklist *creat_deposit() { linklist *head,*node,*end; head=(linklist*)malloc(sizeof(linklist)); end=head; while() {.原创 2021-09-15 17:55:12 · 65 阅读 · 0 评论