[求助]请教各位大虾

lvyan

这是我的数据结构课程设计 1 t X, o1 r# R9 ?实现一个多项式合并，字符串输入多项式，链表插入排序 % s7 q, ~" E3 p% b& j; ~可是我运行出来结果不一样啊，大家帮我看下哪里错了，小的在此谢过啦~~~ 4 M# s- x: @) v0 e#include #include #define MAXSIZE 400 char a[MAXSIZE]; ; x" }# \; Z j* D% \' l5 Ktypedef struct{char elem[MAXSIZE]; & n1 M; \& N' }# S int top; # g2 `$ X4 Z. m! S) l. x }SqStack; ) c* |2 Z% b+ x7 Y, pSqStack S; 4 D5 N3 j" V9 L% Y ^9 }6 s7 T3 wtypedef struct poly # P7 j" [% V. C9 \, t) e {int coef; /*xishu*/ int exp; /*zhishu*/ ( t; S( D, O! E5 \ struct poly *next; / D6 q N+ N2 r. X# D }Lpoly; Lpoly *pa; int cf(int i) /*10^i*/ 6 ?& M; X7 H- b, b, L! l* _% L{ int c=1,j; for(j=1;j<=i;j++) c=c*10; return c; } void input(char a[],int j) { Lpoly *p,*h,*ptr; 6 l0 V h5 P& e. ]: c" N1 W" @6 M int i,k,flag=0,x=0; S.top=-1; ; g& S/ A2 b0 e! w& _3 M C% x5 c pa=(Lpoly*)malloc(sizeof(Lpoly)); % G8 [. ?) p0 l2 q: c: N pa->coef=0;pa->exp=0; h=pa;h->next=NULL; - D) x% ^0 o: d8 J5 E; `2 R* f p=h; /*jianlipa*/ 0 I1 d0 o6 d0 o0 z( o for(i=0;i<=j-1;i++) % q* c! G+ j( ~0 ` {ptr=(Lpoly*)malloc(sizeof(Lpoly)); # M% \, f& O- s if(S.top" V! B* ~- N/ p- j( V" Q {S.top++; S.elem[S.top]=a; } if(a=='-') flag=1; 1 f# M5 Q2 G; ] f if(a=='x') /*fenlixishu*/ $ \- a" c% B2 b3 ^ {if(S.top==0) {if(flag==1) ! V }: H7 L8 C, @$ \3 t. X5 a {ptr->coef=-1;ptr->next=NULL;} ) C1 i+ ~; _9 b/ Q else {ptr->coef=1;ptr->next=NULL;} 8 M. a4 S5 b+ p. d } else " z2 X! k3 m1 ]3 F* M {for(k=S.top-1;k>=0;k--) x=x+(S.elem[k]-'0')*cf(S.top-1-k); . u1 c' p6 y1 d+ r6 I: D ptr->coef=x;ptr->next=NULL;x=0; ) T' w1 f! Y$ v, z } S.top=-1;flag=0; /*clear*/ } 5 Y) F$ r( l% f6 i, e1 E/ B; U9 |( t if(a=='+'||a=='-') /*fenlizhishu*/ % Y- \5 t9 N7 |# R9 ? {if(S.top==0) # @$ W: x0 S4 M5 ~& \. ~ {ptr->exp=1;ptr->next=NULL;} else * T7 @. `7 i. @0 p: q' ^5 g {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*/ 5 f* k4 v5 o( \5 e2 h$ ?# T S.top=-1; } if(ptr->coef!=0&&ptr->exp!=0) 8 r' m ^, ^$ {" T {p->next=ptr; p=ptr; } if(i==j-1) {if(ptr->coef==0) % s, D" b. v F9 n0 t, z {for(k=S.top;k>=0;k--) x=x+(S.elem[k]-'0')*cf(S.top-k); 9 S' I) R2 Y1 ^4 {& i1 i" Y ptr->coef=x;ptr->next=NULL; } " j% K; L5 N9 [' y8 E else {for(k=S.top;k>=0;k--) x=x+(S.elem[k]-'0')*cf(S.top-k); 1 l8 x" M; @7 N% w P9 I- u i ptr->exp=x;ptr->next=NULL; } 2 Y# s: J8 k6 a, R- w* a p->next=ptr;ptr->next=NULL; 1 X: k6 u& F7 ~0 q2 y2 M# S8 }, H } } / i7 y1 A7 K) y- ]6 h1 N} ( ^& s( q/ L/ m- s h. s3 r) }% f1 hvoid stinsort(Lpoly *pa) { Lpoly *p,*h,*q,*k; h=pa;p=K=h->next;q=p->next; while(p->next!=NULL) ]! S/ [3 K& }4 n. W' T {if(q->expexp) . B V& L/ X5 A- s, ?8 @ {while(q->exp>k->exp) {k=k->next; % h3 N" E" |; z/ w h=h->next; } 8 a) ?' H4 j% ]7 C if(q->expexp) Y" T( l) A+ P. Q {p->next=q->next; , U( U3 _$ U3 X: y h->next=q; 9 s# ]% i6 T" ~) i( ]6 \; ` q->next=k; q=p->next; ; w9 B$ r: S) ~0 N } # `! t. \* e. N if(q->exp=k->exp) {k->coef=k->coef+q->coef; p->next=q->next; * Y- A% @/ A0 p7 h# O' R* D! n q=p->next; } h=pa;k=h->next; } - j6 x2 `% F9 X m. J; } if(q->exp=p->exp) {p->coef=p->coef+q->coef; p->next=q->next; : ]0 w- g' I7 A+ }6 V2 u q=p->next; } if(q->exp>p->exp) {q=q->next; p=p->next; ; ?1 A" Y( ?4 N' v( e; e9 k } $ P9 W$ m' ]& r3 ^: Z } } 5 O! y( j ^1 ~* }' rmain() / T, J3 o- p8 G. n1 @{ int i,j=0; printf("a="); 1 c* C6 P' n9 @6 H( y7 G scanf("%s",a); for(i=0;i<=400;i++) 1 i, E$ S8 a* d4 n {if(a!='\0') j++;} input(a,j); ' N! `- |8 Q% x3 S6 y+ I stinsort(pa); 1 `% Z/ t2 Z7 I$ ^1 W* S9 O printf("a="); for(i=0;i<=j+10;i++) : @3 O* P. P, {! p {printf("%dx%d+",pa->coef,pa->exp); / V; x: b1 x1 M8 b pa=pa->next; " W8 ?' q0 y. F- M- H } + Q7 H, q( `+ {+ h- m, a}

游侠无极限

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

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

夜编程

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

夜编程

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

夜编程

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

夜编程

#include "stdlib.h" 8 y0 D. }) u% k8 G* P#include "string.h" ' [( |' o. W, L3 Z; G#include "stdio.h"

#define MAXSIZE 400 8 k+ Y1 Y- R% |. f% o0 ~- ychar a[MAXSIZE];

typedef struct 3 T( M& C5 S8 j{ char elem[MAXSIZE]; int top; }SqStack;

SqStack S;

typedef struct poly . n( r3 b7 i: n/ ?+ }: N5 l2 O8 X2 w{ int coef; /*xishu*/ int exp; /*zhishu*/ ! z: O/ } T, S# e- ]7 \. x struct poly *next; }Lpoly;

Lpoly *pa;

int cf(int i) /*10^i*/ { int c = 1, j; for(j = 1; j <= i; j ++) c = c * 10; " z' z) y0 ?, r" j( O return c; }

void input(char a[],int j) { Lpoly *p, *h, *ptr; ; x" S' L a6 o" Q$ k int i, k, flag = 0, x = 0; S.top = -1; pa = (Lpoly*)malloc(sizeof(Lpoly)); pa->coef = 0; 4 A: `* y7 {8 |, m- e1 A" i pa->exp = 0; & P0 o- P" x9 R# ^8 ]1 x8 P2 b h = pa; & C) F/ B* @ x: ]" _ h->next = NULL; p = h; /*jianlipa*/ 2 h1 B, o( ]# u 7 ]* {2 h8 O% r; I4 b0 B1 | for (i = 0; i <= j - 1; i ++) { ptr = (Lpoly*)malloc(sizeof(Lpoly)); 0 X! d+ D& ]! \) P$ r1 p if(S.top) ( T. ?- A% s, X( q- L8 \$ p { 5 t x3 ^7 v ^/ K5 U) t S.top ++; . R6 M; I d- f4 k( E S.elem[S.top] = a; } 1 e6 F) [+ I0 ? if (a == '-') 6 v/ v! ?7 B) F& T: N" q flag=1; 8 W# F- w3 q1 g0 I! l+ n/ E 6 R o. u/ y+ [ if(a == 'x') /*fenlixishu*/ 6 _5 j( Q/ Z! F4 ]$ O { / F. K& R5 w; [ x# V, E! J: j9 Z if (S.top==0) { if (flag == 1) % p- R; W/ i5 p2 D2 I1 ~ { ptr->coef = -1; ptr->next = NULL; } ! c# S0 v4 H5 J9 F1 M7 G3 [+ C else { ptr->coef = 1; ptr->next = NULL; 2 Q- }3 [1 P' M/ y } 7 n- a0 F) D& \$ E. d& @) f } ' W D9 f9 d" `: o0 M, [( Y& E else 8 G5 F7 d& M) T/ W# S8 w# r { 0 D- g/ c% y: R, x P+ T B* T for (k=S.top - 1; k >= 0; k --) x = x + (S.elem[k] - '0') * cf(S.top - 1 - k); 7 ^2 H3 e+ i* S9 } ptr->coef = x; ptr->next = NULL; x = 0; - V* s. {- L4 o# u7 s: t8 O1 B } p$ `9 G9 x7 N3 U S.top = -1; % v: G, B% N# u3 l* b) C flag = 0; /*clear*/ } |- Q* G) [4 C8 c# {. s if (a == '+' || a == '-') /*fenlizhishu*/ ) e( E+ j/ ]* b { if(S.top == 0) { ptr->exp = 1; ptr->next = NULL; } 1 _* d! i" |' ? else , X1 [- J% w: b { ' E# Q0 ?+ P- `+ [# }( y5 ~* c for (k = S.top - 1; k >= 0; k --) x = x + (S.elem[k] - '0') * cf(S.top - 1 - k); 3 z; M( _) H2 V: I ptr->exp = x; 3 d; @" K, y4 ~: b+ ` ptr->next = NULL; x = 0; }/*tiquzhishu*/ S.top = -1; 3 f+ a3 B9 ?' F. [ } if (ptr->coef != 0 && ptr->exp != 0) { L8 Y2 h5 k) n/ d1 Y p->next = ptr; E9 g, {+ E. X, g" I. K- ] p = ptr; } if (i == j - 1) { ; N* P7 x1 M' ~: t0 E8 m4 s S* h if (ptr->coef == 0) { for (k = S.top; k >= 0; k --) & g, j" L9 f5 d) B3 }7 y x = x + (S.elem[k] - '0') * cf(S.top - k); ptr->coef = x; ; H& x+ g6 \! J9 Z0 y ptr->next = NULL; } else : X, S' G5 X& _ { for (k = S.top; k >= 0; k --) . i/ t; \5 X# m: J% O& k N x = x + (S.elem[k] - '0') * cf(S.top - k); ptr->exp = x; ptr->next = NULL; 3 h5 Z3 x z8 Q" \3 y0 d } " f3 o" C7 E" I5 x# w9 v, Y p->next = ptr; K, \- P- R! q( X" n8 z: F0 _& Q4 g7 v ptr->next = NULL; 3 D4 U: C/ v- c! {$ ] } } * [2 [7 f) m7 |; G- m+ @}

void stinsort(Lpoly *pa) N2 _ N* ]. V! b4 \" F. l8 ?5 {8 e0 H{ Lpoly *p, *h, *q, *k; h = pa; p = k = h->next; 4 q! ?; x# A: N' L7 M. z q = p->next; while (p->next != NULL) 0 g7 R$ ^! Y9 c& ^ { if (q->exp) * j- w* p% w! u o7 F( N { while(q->exp > k->exp) { 9 r5 P7 a3 t. e& u k = k->next; h = h->next; 5 O- ^! a* j2 C* S } if(q->exp) 4 l' Z: ?3 B) d% b% I6 \/ t { ! }; z, j- B* `3 _4 c" ~ p->next = q->next; h->next = q; ( D0 J* I8 x) U q->next = k; 7 {6 w; S$ D/ S4 o% x q = p->next; } if (q->exp = k->exp) { k->coef = k->coef + q->coef; p->next = q->next; q = p->next; ' [- {% P( [8 ^* a } h=pa; * C) n' {7 b1 Y7 s k = h->next; } 5 s1 a4 `5 x' |0 L, e 9 Z! C G& @/ ~ if (q->exp = p->exp) { : w. }6 @, J. l' k. R- P: {0 @3 u p->coef = p->coef + q->coef; p->next = q->next; % I" f" {5 d( F6 y( _ q = p->next; 0 A5 o/ |3 |' x6 v$ b- j* D } ( [* P0 l. ` k+ E m: A if (q->exp > p->exp) { q = q->next; 1 e: l2 _+ I I; i p = p->next; : R, S, I- d2 r( l7 Z3 } } } . p; a: P% A: B/ E+ b}

main() 8 G+ y) x& _! O- C3 _) @' N# @" J{ $ W' ]0 f- H1 C8 y$ l1 I. P int i, j = 0; - n5 \2 s: q3 Y; W: D printf("a="); scanf("%s", a); j = strlen(a);

input(a, j); stinsort(pa); printf("a="); + N! Z, X6 t" B% l5 | for (i = 0; i <= j + 10; i ++) { & X5 j8 d! _& J# y' z printf("%dx%d+", pa->coef, pa->exp); pa = pa->next; * X; N8 t& N% L% C$ l" l } } 9 A) L- o( F# Z/ n! T9 P

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

lvyan

这是上学期的数据结构课程设计
6 G+ @8 s/ _  V$ Q. [" d* d( [3 P, s4 _结果我已经弄出来了，得了个优秀,没跟大家说不好意思
% j% r5 o& v2 ^+ j多谢大家给的意见,我现在水平还很差
; a. l1 Z  L' a8 ~* z' ^至于注释都是给自己看的,发到网上的时候没改,呵呵~~~~~~

Q7

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

Eagle

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

406082496

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