这是结构的一道题.已顺利通过.其重‘T‘代替空格
5 |+ q) y2 ~ L: u8 a8 A #includestdio.h
" t* o- R7 P. u9 M. [" [6 [ #includestring.h" s8 u% L) U; J$ H S% Y7 ]) i
#includestdlib.h9 I. D0 i$ W* [' ^9 _$ E: B
struct huffman;# G& G+ o. A2 H% `6 ~- p
struct list;
& t% s3 S& B$ ]" |. u2 k5 M typedef struct huffman HUFF;
6 u0 i1 F% t5 X+ y5 Q3 f$ n int s1=0,s2=0;) o% Q! N- p5 f2 ?7 ^
void select
! O7 b2 L+ B7 E# U/ \0 u6 J, P if/ }* @8 F6 G7 }
else
7 U8 t2 \* b8 Y4 k for
. Y6 U4 w( R! {4 g if
/ i5 Y! R6 M! C# K }
. F" h8 j- D9 L3 k u( { main
2 {7 ]6 L# X5 K ;
) ^3 d' V3 _" N0 u2 M- \ int *w=a;
' g3 y$ w7 |7 [/ p/ f+ [ HUFF *ht=NULL,*p=NULL;
& y- t2 {* y" ^ int n=27,i,m,j,s;7 _2 E% \/ W1 B4 U! K8 Q% n( {1 j
int c,f,start,l;2 S, h% v( d; p! e1 o
char aa[30],ch[27]="Tabcdefghijklmnopqrstuvwxuz";, E6 g' C4 ^* x( Q
char h[1000];' b$ ]9 I M. \
int h_length,a_length;, e% Z9 |$ Z: w* O( J4 U0 J
char *cd;
; o9 k1 I: W4 |- s struct list *hc;
9 f; I6 ?# z k/ b. d! Z( t6 U7 Y m=2*n-1;
0 g) X" H/ H' O2 Z6 j huffman tree-4 f) r$ v8 q9 o, o9 h2 O5 x
ht=malloc*sizeof);
7 B8 H3 B2 t8 o6 h. D8 S+ z for
1 E( ?% J" B$ C9 K6 h% v for# V$ Z! `* Q& F) _
for8 g' E5 ~6 l$ v$ D! ~
-huffman code+ ]7 m: |1 R% z( M8 [: ^+ V
hc=malloc*sizeof);2 r# G, A' F D/ S3 E) R7 U
cd=malloc);
! @4 [8 B7 u+ A cd[n-1]=‘“0‘;
& z! U7 d. S& |- g7 A' T+ E( r# ~ for9 l1 H% f- y+ Z8 H2 F
free;0 H0 c. `' V' B, F& X) M
scanf;* R$ |5 X1 S o ~8 I" w
-huffmancoding# V' Q l8 y+ F
a_length=strlen;h_length=0;
# z6 G n! O5 Y for
( |- D8 ~, s# @$ `# \+ ^ translating
$ [3 ]; g' q, y8 O1 K i=0;
: Y+ \" I- _/ B2 V* r- A1 H( B while( H" B6 [3 a& j- A2 s3 b' |* V9 h9 h
printf;
! |* T2 c5 L' p0 b- c }/ ?5 O `1 ]0 J4 @7 y
free;
1 ~7 q+ N5 k8 [ for8 o& f7 x; V, \) O* u% H! J; i# X* H% g
free;( C# v3 I+ z3 A: R; U! ]% A% M" l: k
free;- w- w8 e6 R2 Y( j+ ^" b7 C* G
}32 |