[求助]请教各位大虾

lvyan

这是我的数据结构课程设计 $ M# _9 ?4 b5 L) T: u实现一个多项式合并，字符串输入多项式，链表插入排序 ; R4 j- _) I J/ A可是我运行出来结果不一样啊，大家帮我看下哪里错了，小的在此谢过啦~~~ / L3 i/ A0 l2 n#include , \, h+ ^- v+ c+ v* u: `#include ! r6 o# n a# {# r4 g4 M* V3 g; Y2 Q#define MAXSIZE 400 - t: P+ e+ \4 D3 {1 g+ _, ]9 l- ~2 jchar a[MAXSIZE]; typedef struct{char elem[MAXSIZE]; int top; }SqStack; SqStack S; typedef struct poly & T6 a" P0 u% h' `; W( m: C2 [ {int coef; /*xishu*/ + E: X0 m c* v8 {4 @ int exp; /*zhishu*/ 8 Z5 L" R* k; I" s" U3 ^! v struct poly *next; 3 f# @3 y& J% I) p$ C: q- S$ [ }Lpoly; Lpoly *pa; + D; V3 s$ g+ P! xint cf(int i) /*10^i*/ { int c=1,j; for(j=1;j<=i;j++) c=c*10; ' a; ]1 Y0 {3 Y/ K- h. R3 C# I return c; , G, v. S, r- k2 \ J' }: b" V" q} , l, r: i3 F) d0 A p" g- Kvoid input(char a[],int j) 9 o( M0 D) I: q3 I; L# J+ z{ Lpoly *p,*h,*ptr; int i,k,flag=0,x=0; S.top=-1; pa=(Lpoly*)malloc(sizeof(Lpoly)); ; l% X* k0 p9 w pa->coef=0;pa->exp=0; h=pa;h->next=NULL; p=h; /*jianlipa*/ ) A% E$ s& i; K/ [8 L, E for(i=0;i<=j-1;i++) 1 J8 r. x) R! t {ptr=(Lpoly*)malloc(sizeof(Lpoly)); if(S.top6 J, B: W8 m# M% {' @ {S.top++; - k( a) I3 x: u) I6 A S.elem[S.top]=a; } ! ^ u) P8 O+ v/ h7 \; d+ d if(a=='-') flag=1; if(a=='x') /*fenlixishu*/ {if(S.top==0) 2 j! Q( @1 i7 H {if(flag==1) {ptr->coef=-1;ptr->next=NULL;} else {ptr->coef=1;ptr->next=NULL;} } else {for(k=S.top-1;k>=0;k--) x=x+(S.elem[k]-'0')*cf(S.top-1-k); ) i' g6 g8 _7 v2 [! V2 U/ z( U ptr->coef=x;ptr->next=NULL;x=0; , k! l' T8 @8 x$ h3 k, d2 d } S.top=-1;flag=0; /*clear*/ } if(a=='+'||a=='-') /*fenlizhishu*/ {if(S.top==0) $ c1 F) B! M- ? {ptr->exp=1;ptr->next=NULL;} else / x% m# a' g+ O/ e( ^ {for(k=S.top-1;k>=0;k--) x=x+(S.elem[k]-'0')*cf(S.top-1-k); ptr->exp=x;ptr->next=NULL;x=0; } /*tiquzhishu*/ S.top=-1; } 9 H# ~0 s( f( y2 C+ ]6 \* N9 X# ^ if(ptr->coef!=0&&ptr->exp!=0) ' P5 M, ]5 Z9 a {p->next=ptr; p=ptr; } if(i==j-1) {if(ptr->coef==0) {for(k=S.top;k>=0;k--) x=x+(S.elem[k]-'0')*cf(S.top-k); ptr->coef=x;ptr->next=NULL; } 6 O9 T" j2 ^* h8 c' V/ y8 F else . z: X# G! D8 G5 y' O" D {for(k=S.top;k>=0;k--) x=x+(S.elem[k]-'0')*cf(S.top-k); 1 p2 o2 g8 c! v [2 m ptr->exp=x;ptr->next=NULL; 7 x$ w2 X6 A8 J R" d } p->next=ptr;ptr->next=NULL; 8 G# |2 J8 H( p$ b! X, ^ } } # e4 n: F+ s1 @3 z. l# E} 8 d9 S1 z4 {. F }* l. _void stinsort(Lpoly *pa) % f6 o% B* I9 O& p: V) a$ M{ Lpoly *p,*h,*q,*k; % U/ B3 `7 N) Y& R8 b h=pa;p=K=h->next;q=p->next; 2 {7 }5 t. z$ E" P while(p->next!=NULL) {if(q->expexp) 8 f8 Z6 t$ u4 G1 \ {while(q->exp>k->exp) {k=k->next; h=h->next; } $ _9 O0 ^: C' p$ g% R! C/ r0 e8 V if(q->expexp) {p->next=q->next; 2 ?3 b7 h: z; Y. E0 T3 a h->next=q; + G2 n, W- M3 { q->next=k; q=p->next; } 0 q! V& Z* m! _/ ~ k if(q->exp=k->exp) 2 R$ Z+ m$ {9 B" H' ? {k->coef=k->coef+q->coef; 3 b9 q" B4 S3 s( v# O p->next=q->next; $ g! M/ f& ?" x' J2 Z1 s8 p' N q=p->next; } 2 t) Z. n9 F% n- e* Y+ J0 } h=pa;k=h->next; % k' e4 G: Y5 x% p } # n+ |* C. H5 v6 h/ K if(q->exp=p->exp) $ M2 K8 }9 ~7 a* j3 h0 \; Y/ N {p->coef=p->coef+q->coef; p->next=q->next; q=p->next; } if(q->exp>p->exp) {q=q->next; . S, g( m4 x1 k" y+ R p=p->next; } } } * x H4 n* e+ P+ b- vmain() , t: }7 F; }) C h{ int i,j=0; printf("a="); scanf("%s",a); for(i=0;i<=400;i++) {if(a!='\0') j++;} input(a,j); ) k6 t. ?' G/ ~3 ]6 @, {0 ~ stinsort(pa); % a( K9 J( X9 f! u1 G4 o" f printf("a="); n, t& ?! x. T8 q9 R# i- \" ` for(i=0;i<=j+10;i++) {printf("%dx%d+",pa->coef,pa->exp); pa=pa->next; } }

游侠无极限

猛然发现我已经受不了C的那种模式了……尤其是别人写的……

还有搂主最好打个包，代码发到BBS上全走样了，有些符号没了，没办法帮你看

夜编程

不用对齐的编程风格也就算了，可是把几行挤到一块儿的风格也太小家子气了吧？改改啦，不改成不了程序员的。

夜编程

还要注释要么用英语，要么就用汉字，不要用拼音，恶心死了，不是每个人都习惯看拼音的。

夜编程

还有，楼猪这段代码错误满天飞，居然也可以运行？

夜编程

#include "stdlib.h" 1 a& ^2 V% h# U#include "string.h" #include "stdio.h"

#define MAXSIZE 400 $ `9 I; u0 A! \char a[MAXSIZE];

typedef struct { 6 C0 N$ D i7 x char elem[MAXSIZE]; 5 O0 V$ W: I. | int top; }SqStack;

SqStack S;

typedef struct poly { int coef; /*xishu*/ " k' P+ p- a$ O6 p: u8 x% g int exp; /*zhishu*/ 1 a1 c0 d6 ?0 n* j0 [ struct poly *next; }Lpoly;

Lpoly *pa;

int cf(int i) /*10^i*/ " G, ?/ L3 [- ?{ int c = 1, j; for(j = 1; j <= i; j ++) c = c * 10; return c; }

void input(char a[],int j) { , U% Q" N4 N- V& X4 K Lpoly *p, *h, *ptr; int i, k, flag = 0, x = 0; S.top = -1; ! ^0 |' }) E8 K8 U0 _ pa = (Lpoly*)malloc(sizeof(Lpoly)); . ]; A- X/ c7 u pa->coef = 0; pa->exp = 0; h = pa; 7 P6 i& T) C& @0 ?: g- H! g h->next = NULL; 6 K( x/ r2 S+ C# _& U p = h; /*jianlipa*/ for (i = 0; i <= j - 1; i ++) $ \9 |+ \4 S7 g/ v { ptr = (Lpoly*)malloc(sizeof(Lpoly)); if(S.top) { ' u/ w2 c5 x# [. G3 e S.top ++; 8 h' ]: H1 G( z! O) ~- L- X S.elem[S.top] = a; 9 ]9 b, @ P4 e: d8 J. j6 ~ } ) i j! O, F- f if (a == '-') flag=1; if(a == 'x') /*fenlixishu*/ 0 J4 }# [9 G( C' Y8 i { # Y3 G8 N$ a5 D) y) x! C8 L if (S.top==0) : x, U& |; d/ y) G {3 g! ` { if (flag == 1) { ptr->coef = -1; $ n$ |- f% L( p! h; n5 D ptr->next = NULL; } else { ptr->coef = 1; 8 a7 o( I( l+ o8 u6 j! Q9 K* S ptr->next = NULL; } ( W, m% l- v n" j" S3 \ } 9 e p- ?3 A- @4 o; g9 O- u0 i else { # @( h$ ?$ j! N; g [" C2 S5 Q for (k=S.top - 1; k >= 0; k --) x = x + (S.elem[k] - '0') * cf(S.top - 1 - k); 6 N" d7 Y$ s- d) q! H) V4 Q ptr->coef = x; ptr->next = NULL; / {7 p& c: V% o. @ x = 0; + T6 V, d" u4 e! t } S.top = -1; flag = 0; /*clear*/ % ^' @7 Y: ~4 a% C } if (a == '+' || a == '-') /*fenlizhishu*/ { / }# a! y, w7 q" e: ?2 t. d if(S.top == 0) { + m: s. m6 C4 N2 } N ptr->exp = 1; ptr->next = NULL; } else 8 O. @& w9 P+ L) q! } { - k: i7 U7 U6 A, ^0 c for (k = S.top - 1; k >= 0; k --) ; f$ H9 y# c: s( ]: h4 i. D6 s x = x + (S.elem[k] - '0') * cf(S.top - 1 - k); 7 E+ n D/ R6 |2 w, X1 u ptr->exp = x; ptr->next = NULL; ! ]* S1 D1 l# T* \6 ~7 o. @7 A( Y x = 0; }/*tiquzhishu*/ {) _/ k4 D! ~+ s) ?: N3 z6 A. Q S.top = -1; ( t/ n/ v9 n1 A; r, S) b } " L* K% K$ D" {* e# I$ W" Y' q if (ptr->coef != 0 && ptr->exp != 0) { p->next = ptr; S6 C5 `& x+ D$ ?3 U! s p = ptr; } if (i == j - 1) { / w/ V% T+ Q( |0 ?- P. a( ? if (ptr->coef == 0) h3 B( D o! z* z { for (k = S.top; k >= 0; k --) 0 [; H6 Y) [" I! V3 q x = x + (S.elem[k] - '0') * cf(S.top - k); ptr->coef = x; ) A' q: O& L! \! x8 L ptr->next = NULL; } " y% J9 E6 A! z' l; P0 \ else { for (k = S.top; k >= 0; k --) x = x + (S.elem[k] - '0') * cf(S.top - k); ptr->exp = x; 2 b2 p6 d8 t7 x& n; h ptr->next = NULL; } % o" j" ~# l9 F i6 o p->next = ptr; , [* O* m" |( `7 A# Z$ n1 q" X ptr->next = NULL; } ) B+ s3 K+ e G7 _ O2 R/ h) c } }

void stinsort(Lpoly *pa) { . c! D+ G! c2 Z& Q' E9 R. U7 ] Lpoly *p, *h, *q, *k; h = pa; " {: I1 n& s& y7 h6 e/ Y- R p = k = h->next; . ~+ V+ O9 }1 ?7 X! e3 [1 M q = p->next; - [1 Q& n* @; `6 I' {4 B3 l while (p->next != NULL) { if (q->exp) { & r" g' b0 z" Y; ?+ t while(q->exp > k->exp) 3 @. {/ G! K. A# R! U { k = k->next; # ]9 o% [ x$ ?/ C' u/ `6 o1 F h = h->next; 3 h9 a2 E. T/ b6 i. C2 W } , W1 c$ Z. ?5 y( ~ if(q->exp) { - l( q0 K9 U3 D# R6 L; N$ ~ p->next = q->next; $ P/ Q: s' E6 n3 j% r+ [1 z# g h->next = q; q->next = k; q = p->next; } if (q->exp = k->exp) ! B) j2 _* c* L0 R { & k7 M: F# D8 B" S0 H8 D, s( F k->coef = k->coef + q->coef; p->next = q->next; q = p->next; } & ]9 s8 _3 X+ V9 {$ p0 f h=pa; k = h->next; } if (q->exp = p->exp) 4 m+ u. M8 }$ [: _& t, r { ' Z% o3 k/ f, j2 q3 m p->coef = p->coef + q->coef; p->next = q->next; q = p->next; } : Y: R Y1 P: e if (q->exp > p->exp) { 9 ^- K) z$ k; g5 z( c% H* n0 @0 c- L q = q->next; 4 o0 z9 d5 b5 W) Q) \ p = p->next; 6 u, D" f' V1 H } 1 ?5 z+ L( A% K& { } ; {; t( ]+ ^7 s}

main() # Y7 M1 V. C9 b0 T7 |( ~2 L, t{ int i, j = 0; printf("a="); scanf("%s", a); + t3 b; F* J$ _3 h/ [ j = strlen(a);

input(a, j); stinsort(pa); * J3 R* m; k0 Y) L3 B printf("a="); for (i = 0; i <= j + 10; i ++) { printf("%dx%d+", pa->coef, pa->exp); pa = pa->next; } 5 o2 P! \6 T. h: @ r}

我把楼猪的代码弄了下，把里面大小写错误排除了，这段代码会有死循环，谁有空谁研究去。

lvyan

这是上学期的数据结构课程设计
  T- O3 L. k! x+ w" U结果我已经弄出来了，得了个优秀,没跟大家说不好意思
多谢大家给的意见,我现在水平还很差
. p9 M8 T/ ^( n% p7 Q: K6 [至于注释都是给自己看的,发到网上的时候没改,呵呵~~~~~~

Q7

全还给老师了- -想当初为考试忙这忙那的

Eagle

老帖，一口血就出来了……

406082496

it is too hard for me!!~~~~~