|
|

楼主 |
发表于 2005-3-31 02:09:19
|
显示全部楼层
前几天看完啦折大的c因为忙于看数据结构就忘啦点评完.下面接着点评
7 ?& n3 m. N9 v& ?9 N9 N1 J8 G, J# |对于指针课程分的很详细讲有下面的例子是指针数组
( K( G- p7 u+ a H#include<stdio.h>! q; h) D; G) \; G( R$ i
void main()
- e; S L/ n; }% A5 w- I+ x{3 K' S7 Q i) ^! F
char *name[4]={"wang","li","zhao",jin"};- Z& ] i) F9 R, z8 X
char **pp;
/ M7 r" a0 {$ Wfor(pp=name;pp<name+4;pp++)
3 d1 ^1 M& i3 R) Q3 K. Yprintf("%c",**pp+1);; ~7 r# ]0 ~; }( {% h3 p& K
}
( Y5 N+ G8 A/ h2 k# l但我唯一觉得不足的是数组指针的例子太少可能和课时太少有关吧!对于链表我认为是讲的最好的部分在该课程中从算法到流程及最后的程序书写下面给出链表的一个例子:, H; C$ Z) G, ~( p+ C& M. J5 T
#include "stdio.h", g/ N$ w7 d V. Q
struct student{
" w: B3 c2 F8 N2 j2 U0 C, g( i8 Vint num;
9 Q% v! H- o9 K( g. ~float score;& E% C) |/ i3 @: v
struct student *next;
. [" r9 |9 l; r! r};
$ u* ], M) V3 }0 w$ Ystruct student *creat();$ g1 p( m6 ~" q2 P
main()
: I+ [ J5 i* F; S) a8 @' d2 o{
) }9 }' e' y4 F: p5 n' Z5 {! Tstruct student *head;
/ A# O. P d+ }0 P5 V# e `: Thead=creat();; ^" g, y7 C. z/ ?( o' {
}
$ E' ?! }* p9 f q9 ustruct student *creat()- h/ `8 V4 K% T$ R( e
{struct student *head,*tail,*p;float score;, A5 O7 y% C9 D6 m8 Y( V! K, c
int num,size=sizeof(struct student);4 r/ z$ N4 B- O4 I( t( T
head=tail=NULL;, ~2 K5 [ Q! N, X# |- G
scanf(%d%f",&num,&score);1 f4 F2 m6 |6 t" S% N% y
while(num){
! j4 m) B( H+ n. k5 U1 F0 X' t- tp=(stuct student *)malloc(size);; g6 I' a2 O3 g4 ^
p->num=num;p->score=score;
1 c* ]6 t1 M7 }: D9 ~p->next=NULL;
' q; ]. @$ i2 T- Q, r: |if(head==NULL)head=p;( j$ v) S0 O% t9 \
else tail->next=p;
) B, n5 l$ o9 ~1 Y8 q' Jtail=p;
* J J/ i; e' \, A; E- S$ v4 o6 hscanf("%d%f",&num,&score);
+ N4 K2 x: ~7 n5 m" S0 i; @}2 \% H# S# V% y6 K y$ M9 i6 e
return head;}
" _5 Z8 s3 w+ ~) e+ Z& q6 }. d联合就没讲,这里是因为课时的关系就没讲可惜啊!- N0 h! u1 T' t
总之该课程讲到之处都是经典的值得在一次学习. |
|