C语言-【链表】建立、输出、删除、插入

2Vv/R"E6pZH7m0/*建立链表的函数*/
{;d+w"I5~_&T0#include<malloc.h>51Testing软件测试网RG;WzR:`:o4O,K
#define NULL 0
8l NX `vj4g"z0cP:l~}0#define LEN sizeof(struct student)51Testing软件测试网9l)}4\Od&E4E
struct student
A%uC_u3R5s2E+p0{
5},q2q0dk[0    long num;
P S[+O'UI/^Qu/Z0    float score;51Testing软件测试网O2y X1nB`z
    struct student *next;
0L(FR7N0r1sYW0};
*t3Yn o?#Ju0int n;

+Y3Y&W0k/a0T0/*定义函数，此函数带回一个指向链表头的指针*/
kq#Ldp,n m0struct student *creat(void)51Testing软件测试网#E'UmM2ub
{51Testing软件测试网{*w:?%Lm3`6Hh
    struct student *head;
4n CB6\+i-S.m0    struct student *p1,*p2;
!r1V|a*oMz0    n=0;51Testing软件测试网"kk0X,i{6s^
    p1=p2=(struct student *)malloc(LEN); /*开辟一个新单元*/51Testing软件测试网@N3Eo'R3n7WJ
    scanf("%ld,%f",&p1->num, &p1->score);
a+_lw0\$I:K6A0    head=NULL;51Testing软件测试网 ~Y9{*j'`#\B)`
    while(p1->num!=0)
{'VbJ_0|6n0    {51Testing软件测试网9JP5h0vzV ^
        n=n+1;
]N(f6a1DG U0t2[%q0        if(n==1)head=p1;
oiM7iwU0        else p2->next=p1;
x(jXus!m"C0        p2=p1;51Testing软件测试网&Q2CXo{6m5zL[1u
        p1=(struct student *)malloc(LEN);
ko!?E-lX0        scanf("%ld,%f",&p1->num,&p1->score);
6}8eg,e,ik)m0    }51Testing软件测试网j8Z/{.xM.H-dV2w-d
    p2->next=NULL;
*R m[
a#uoI%Ch1PT~0    return(head);51Testing软件测试网R@bG4F9U
}51Testing软件测试网!o$dT'@;{NOv

w!hl+?'p:`0/*输出链表*/
d
S1EG#`uy0void print(struct student *head)51Testing软件测试网M(L;i%sk7gZt
{
[IU^zD
zV*C-B0    struct student *p;
z&O#?(CrKy`by'P$I0    printf("\nNow, These %d records are:\n",n);51Testing软件测试网4c+lEakM)c
    p=head;51Testing软件测试网;H^J#J#j,up9v7B&{
    if(head!=NULL)
&y+x+Y#wg)M;g0        do51Testing软件测试网{u;YQ,R4f5VVzT
        {
4h WA*J
aiJ0            printf("%ld %5.1f\n",p->num,p->score);51Testing软件测试网A X"G,h&j
            p=p->next;
8T c n&w YM/O/\0        }while(p!=NULL);
[2V-L GY jl0}

/*删除结点函数*/
.q u*HME%J2AWm0struct student *del(struct student *head, long num)51Testing软件测试网xs+G:g4}6st
{
yBF_MF5J#JZ0    struct student *p1, *p2;
i/XgZ0bl&e1Gs0    if(head==NULL){printf("\n list null!\n");goto end;}51Testing软件测试网`V%Tkm;v-b
    p1=head;
D^"ul3{X&sh W0    /*p1指向的不是所要找的结点，并且后面还有结点*/
,H/T,PyP3f(h0    while(num!=p1->num && p1->next!=NULL)51Testing软件测试网!~Y*v!_#Vp&I*^
    {51Testing软件测试网,`'\r8P2t
        p2=p1;p1=p1->next;/*p1后移一个结点*/51Testing软件测试网xTVY8ig
    }51Testing软件测试网)o"zCj[B
    /*找到该结点*/51Testing软件测试网egN vP
    if(num==p1->num)
{YJ'x ~0    {
0C9j0{$p6K5XxJ0        if(p1==head)head=p1->next;/*若p1指向的是首结点，把第二个结点地址赋予head*/51Testing软件测试网&gq[S\"E
        else p2->next=p1->next;/*否则将下一个结点地址赋给前一结点地址*/51Testing软件测试网;LU0a)Q3t)G3cK*a
        printf("delete:%ld\n",num);51Testing软件测试网_8Rd%t
[+A'U,u
        n=n-1;
N SXJ h0    }
Hj[!Z%f"yC&j6Q"ek0    else printf("%ld not been found! \n",num);
2Y y V S0Sq)t0f0    end:
jd)A~ [l&{)G9bF$^0    return(head);51Testing软件测试网 s%HEp#t;Ty&V#?
}51Testing软件测试网kas,H~4d!j

C)C6ZN W)CW0/*插入结点*/
.h^zg?P0struct student *insert(struct student *head, struct student *stud)51Testing软件测试网\fA~
ab/v
{
(x$he+j}g]*Wt0    struct student *p0,*p1,*p2;
5Y1N)F
I3R |J.s0    p1=head;51Testing软件测试网X&S(p"E S9A/K1h
    p0=stud;
sm.L*Xw5Jm0    /*原来的链表是空表*/51Testing软件测试网2E Bqa'j]-w3N%y
    if(head==NULL)51Testing软件测试网%Y+b+c7P$tv
    {51Testing软件测试网)A7[oifkv
        head=p0;p0->next=NULL;  /*使p0指向的结点作为头结点*/
VI;~9oIx!Is*i0    }
'D6ySoU]_0    else51Testing软件测试网*ZD"?7Vf'P$S
    {
\A"e#d }Pl|*cNj0        while((p0->num > p1->num) && (p1->next!=NULL))
Vq i(R2_2pm0        {
2hDo/BKD] u0            p2=p1;51Testing软件测试网NaS#x;Vr
            p1=p1->next;
%lf/n$z4\ n-|+R5|V0        }51Testing软件测试网rl`bTM
        if(p0->num <= p1->num)51Testing软件测试网q}"M!i6uEj6f8c
        {
%A9c @+_"cWtr-S_0            if(head==p1) head=p0;/*插到原来第一个结点之前*/

Q ||9X!^-TD0            else p2->next=p0;
D/E&`^Q&r"]0            p0->next=p1;
!p.?|cl0        }51Testing软件测试网4S/[
b]Ix3E-I
        else51Testing软件测试网TFcr%rP
        {
}(B%|G{'}4W9v0            p1->next=p0;p0->next=NULL;51Testing软件测试网K+BBZ/Dsb.b\
        }51Testing软件测试网;[6Lg
Mw \*Z5e
    }
0kT5H~/Z~%L4Z&K0    n=n+1;51Testing软件测试网&f$mm4^F0x-e+m
    return(head);
.Q|b8Av0^Xp$R0}51Testing软件测试网)Dn0sl*gB.sg

0w+t:E!\HY$os5X0/*删除一个结点，插入一个结点*/51Testing软件测试网)xO)vg hq
/*main()
Q^wPA0{
+E;XhyrG+Y0    struct student *head, stu;
0s!Awz_7_0    long del_num;
B[)F;JY)kg~n0    printf("input records: \n");51Testing软件测试网 kL~2k:Kx
    head=creat(); //返回头指针
f#ln/{ Yr'D?bL0    print(head);  //输出全部结点51Testing软件测试网(Xiv+q^[f
    printf("\n input the deleted number:");
$]/JO5]m }C v0    scanf("%ld",&del_num); //输入要删除的学号51Testing软件测试网LusF
|;W7\y
    head=del(head, del_num);  //删除后链表的头地址
yEW,d CX[0    print(head);51Testing软件测试网!m$s,q*k!?U/C'X
    printf("\ninput the inserted record:");51Testing软件测试网DO,s&y.C'a+[3e/c
    scanf("%ld,%f",&stu.num,&stu.score);
k1Ac-g/p8N[*w0    head=insert(head,&stu);51Testing软件测试网`:?VS4\&@
    print(head);
t
XmK eOX0    getch();
Izt-k_du]M \0    return 0;51Testing软件测试网'o6HVDdh
q
}*/51Testing软件测试网(Ub/Zf7h+W,wSnZ

0[y_H } TT}0/*删除n个结点，插入n个结点*/51Testing软件测试网0[ VQK}5U r
main()51Testing软件测试网;v IV+G.t2Nj
{
e(\#lDI%pb0    struct student *head, *stu;51Testing软件测试网0^d M4p7b6hK)N2_x
    long del_num;
MZwq$YA0B0    printf("input records: \n");
Z
h%wT1U4Y0    head=creat(); /*返回头指针*/
B5oa8u0Q0    print(head);  /*输出全部结点*/
^p\a"M0    printf("\n input the deleted number:");
7I'^f!^*P'Sc0    scanf("%ld",&del_num); /*输入要删除的学号*/51Testing软件测试网@Kw5db
    while(del_num!=0)
asPFE9V9Cq\9[0    {51Testing软件测试网Eq]4CuNC
        head=del(head,del_num); /*删除后链表的头地址*/
$?tk1T p P]E0C0        print(head);
8IK"u
I1S9^4bOS%lab0        printf("input the deleted number:");51Testing软件测试网^ WYHL
        scanf("%d",&del_num);
D;N8Qa.v){0    }51Testing软件测试网 K-^+tL2i
    printf("\ninput the inserted record:");
'V0Vr#wDP0    stu=(struct student *)malloc(LEN);
Wk8F4a!D%] uN0    scanf("%ld,%f",&stu->num,&stu->score);51Testing软件测试网+@+| P(IV1N O!G
    while(stu->num!=0)51Testing软件测试网2_DL/W2Nk)eR"t
    {
Qb/G7GpQ!e^ f0        head=insert(head,&stu);
\-y:S%CTT E/oiQ0        print(head);51Testing软件测试网 kG;KLBz
        printf("input the inserted record:");
v~5Y E{s:t#O.a0        stu=(struct student *)malloc(LEN);
'y*FD0w#h\5Wb*g;K:o5d6W0        scanf("%ld,%f",&stu->num,&stu->score);
{n*tdFm~*y0    }
O$`b3mn#m]9@K0    getch();51Testing软件测试网H)x`MWUM
    return 0;
X Ad} {f.B1b2AI0}