[求助]请教各位大虾

lvyan

这是我的数据结构课程设计 $ H6 Z1 g5 x! L# f实现一个多项式合并，字符串输入多项式，链表插入排序 可是我运行出来结果不一样啊，大家帮我看下哪里错了，小的在此谢过啦~~~ #include #include 7 `5 T l! w9 n; h#define MAXSIZE 400 + M3 n) q- P' ]) _3 o* D5 Q! echar a[MAXSIZE]; typedef struct{char elem[MAXSIZE]; int top; - o9 r! W9 O8 }2 y; B# \6 [ }SqStack; . L+ g0 P# i5 c6 {SqStack S; K- M) Z+ r2 h( Atypedef struct poly {int coef; /*xishu*/ int exp; /*zhishu*/ - ], A" L* a: k; \2 H struct poly *next; }Lpoly; Lpoly *pa; 0 t$ G: g: O& M! `) qint cf(int i) /*10^i*/ ) c- B- d7 U0 v: [{ int c=1,j; " \; w2 q2 j. D0 o for(j=1;j<=i;j++) c=c*10; return c; } void input(char a[],int j) - q; T& |) K, k8 N% w' ?& M0 c; Q{ Lpoly *p,*h,*ptr; int i,k,flag=0,x=0; S.top=-1; - Q" s" T' U' f, O1 X6 C pa=(Lpoly*)malloc(sizeof(Lpoly)); pa->coef=0;pa->exp=0; 4 v; x* w' A9 s4 L U7 e+ ` h=pa;h->next=NULL; ! s! z- _5 A/ B3 b4 @3 z" x0 D; T p=h; /*jianlipa*/ 9 Z4 | e/ B9 J) X, h0 g* h5 b for(i=0;i<=j-1;i++) 3 H5 N0 q& I; k7 V {ptr=(Lpoly*)malloc(sizeof(Lpoly)); if(S.top% Y" c4 U, ^! P, w+ ]( y- F {S.top++; 5 T5 c% D' g2 \2 A# o0 L S.elem[S.top]=a; } if(a=='-') flag=1; - @' u1 u, N- R8 V! H" a if(a=='x') /*fenlixishu*/ {if(S.top==0) {if(flag==1) / [. v. r2 e. B9 E! A {ptr->coef=-1;ptr->next=NULL;} " j5 H2 r, u. ?" T( m, D else * [( V$ s) u' V: L {ptr->coef=1;ptr->next=NULL;} , ^' y! a# ]6 _" s8 i; a# T } else {for(k=S.top-1;k>=0;k--) x=x+(S.elem[k]-'0')*cf(S.top-1-k); ptr->coef=x;ptr->next=NULL;x=0; } 8 U% ]. A. I/ F5 l9 ?0 D S.top=-1;flag=0; /*clear*/ ' c9 V7 X* O4 s$ X' H& W4 w } + J: D( K4 ]4 C7 t if(a=='+'||a=='-') /*fenlizhishu*/ {if(S.top==0) {ptr->exp=1;ptr->next=NULL;} else {for(k=S.top-1;k>=0;k--) x=x+(S.elem[k]-'0')*cf(S.top-1-k); 6 S+ N/ Q R! a, w/ K& E' w ptr->exp=x;ptr->next=NULL;x=0; } /*tiquzhishu*/ S.top=-1; , @0 S5 h7 p' f" r$ g; P* X6 v& Z( P } 6 ]$ n5 m4 J. E Q8 D% `: T4 J0 U if(ptr->coef!=0&&ptr->exp!=0) 2 Y+ G& N8 R- T# G3 \+ k3 B% ~! w# s {p->next=ptr; " V' Y; Q% J0 v5 \8 B/ p$ h p=ptr; 7 j( R1 j( o7 ? } " Z; ~, g, G l1 ^ a6 ^$ j if(i==j-1) {if(ptr->coef==0) X3 q- I6 W+ R5 y! ` {for(k=S.top;k>=0;k--) x=x+(S.elem[k]-'0')*cf(S.top-k); 0 O1 L. I# G+ ^% F ptr->coef=x;ptr->next=NULL; " A; w) _1 |) W U/ j7 ] } else 4 v" i( g3 c. u% M0 x {for(k=S.top;k>=0;k--) ; C& }/ _& `5 c$ j/ \" R/ y x=x+(S.elem[k]-'0')*cf(S.top-k); 6 X F" Q% H" ?2 k ptr->exp=x;ptr->next=NULL; & |! Z- h" V R } ( l) T6 f2 \8 d p->next=ptr;ptr->next=NULL; + y9 W' u3 @% c- R } } } * ^# [% r8 Q8 {6 y7 I3 tvoid stinsort(Lpoly *pa) { Lpoly *p,*h,*q,*k; h=pa;p=K=h->next;q=p->next; while(p->next!=NULL) {if(q->expexp) ! t% @ y) X _ {while(q->exp>k->exp) {k=k->next; h=h->next; } if(q->expexp) {p->next=q->next; ) R4 A0 R- d& H7 B& T6 | h->next=q; % S% M# q+ ^: V q->next=k; 9 n2 f) h9 g5 L/ M q=p->next; } 1 a# W/ }( h) u) A4 T W if(q->exp=k->exp) + d- g9 c1 R8 d: d8 G( E {k->coef=k->coef+q->coef; p->next=q->next; q=p->next; " w% t* p/ r2 p$ m } % d6 Y0 ~) P( J! F/ c h=pa;k=h->next; } if(q->exp=p->exp) {p->coef=p->coef+q->coef; ' ?8 ~# [8 j4 j7 F8 o% i7 F p->next=q->next; 7 h( [* l- T8 V* b q=p->next; } if(q->exp>p->exp) {q=q->next; p=p->next; ' l% X6 w( o; P9 E! g' k2 c } } ( N6 s8 W4 T4 O} main() { int i,j=0; printf("a="); 0 o3 @# A5 F, U8 n# f, i) } scanf("%s",a); for(i=0;i<=400;i++) {if(a!='\0') j++;} input(a,j); stinsort(pa); printf("a="); for(i=0;i<=j+10;i++) {printf("%dx%d+",pa->coef,pa->exp); pa=pa->next; } }

游侠无极限

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

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

夜编程

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

夜编程

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

夜编程

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

夜编程

#include "stdlib.h" #include "string.h" #include "stdio.h"

#define MAXSIZE 400 6 s" I8 |* u$ F ?1 Zchar a[MAXSIZE];

typedef struct ; ^* |9 A' J" d; H{ ) x$ [: m1 |% g0 ~/ s* Q char elem[MAXSIZE]; int top; }SqStack;

SqStack S;

typedef struct poly 6 f: M, x3 p2 g{ ; o% d9 g* m- m6 R int coef; /*xishu*/ int exp; /*zhishu*/ / }5 a2 y0 n% s; R$ P struct poly *next; 0 f) {2 s. J% Y3 `9 q& y}Lpoly;

Lpoly *pa;

int cf(int i) /*10^i*/ , Q0 R6 A! f' g% H. E{ int c = 1, j; for(j = 1; j <= i; j ++) c = c * 10; return c; ; p/ Z! g$ r2 l. z; ?4 [% g}

void input(char a[],int j) ' M$ I d+ R. z! C8 a) j* w( ]{ ( W4 r# S( {6 t$ T% U* Z, L Lpoly *p, *h, *ptr; int i, k, flag = 0, x = 0; 7 {$ `2 p# X' Y4 @- [7 ^. n S.top = -1; , J/ X9 v- @- O pa = (Lpoly*)malloc(sizeof(Lpoly)); 4 G" A9 w$ t9 w/ a | pa->coef = 0; 5 `- q1 v: D O' O {3 b# d9 S pa->exp = 0; h = pa; 5 [$ f7 H$ `: b, }! d h->next = NULL; p = h; /*jianlipa*/ ) i6 n8 g) W3 N, j }# G8 v for (i = 0; i <= j - 1; i ++) % m! k4 f9 g0 Q) _ z; U { 9 j0 t& S) Z& { G+ r3 x ptr = (Lpoly*)malloc(sizeof(Lpoly)); if(S.top) { 3 J7 t9 R6 A9 h# Y/ b0 B2 B S.top ++; 4 Y' u" m/ q) y3 I S.elem[S.top] = a; . d8 ^# O% O7 }8 |$ q( D* R) b } 1 S: f5 S) q' Z# r+ W( s if (a == '-') flag=1; ! J3 P" y) T2 b$ [0 Z) ]# A4 r ) I( ^8 q' K! b9 k7 E( { if(a == 'x') /*fenlixishu*/ 7 G, Y3 V h, O; z1 }0 C: X { if (S.top==0) { 7 H- i% o' _! g& \0 N- L if (flag == 1) { ptr->coef = -1; ' b% w* z- k3 E" F ptr->next = NULL; ; @$ E; p' {0 z" W } . U# }) r0 u1 {4 c4 j else { 8 ^ @3 ]8 f9 m: l& K ptr->coef = 1; ptr->next = NULL; 2 c# X3 A- {3 q, g- e& c8 D: D1 ` } } ! P3 k6 N7 W( B% _- w3 F( C+ u3 X# b3 U. @ else { for (k=S.top - 1; k >= 0; k --) x = x + (S.elem[k] - '0') * cf(S.top - 1 - k); ! x3 L& {. w2 @" ?+ N! ] ptr->coef = x; " x0 y: p: Y1 g7 B( } ptr->next = NULL; x = 0; 3 d; A4 w9 B( g1 `+ g$ g } " h4 M. Q6 k# P# @& t. ^' [6 w8 x B S.top = -1; flag = 0; /*clear*/ - B9 N: G) P2 b4 T# ? } if (a == '+' || a == '-') /*fenlizhishu*/ { % l: o7 [! v# F* L if(S.top == 0) ' r" O, ~" p0 t { ( Q* o% ]1 w, ]- ]% } ptr->exp = 1; . }. c( W* b$ ? ptr->next = NULL; } else { 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*/ ! G8 z, c& z1 w/ }; m S.top = -1; 0 F( T- x$ Q. N: t3 | } if (ptr->coef != 0 && ptr->exp != 0) h+ m. d4 @; Y: t { p->next = ptr; p = ptr; } if (i == j - 1) 2 j5 w# \% g, f9 T- _' Q { : W1 d$ W; B4 e v" e% N \ if (ptr->coef == 0) { % t7 [+ F, P% |5 x1 M" ^! Z7 ^1 w2 f for (k = S.top; k >= 0; k --) ; \2 v: G7 E5 q; L( F& | x = x + (S.elem[k] - '0') * cf(S.top - k); ptr->coef = x; ptr->next = NULL; } else % Y0 B E P# {# c { for (k = S.top; k >= 0; k --) x = x + (S.elem[k] - '0') * cf(S.top - k); 2 b$ @: K/ i/ \! M" |+ z ptr->exp = x; ptr->next = NULL; } p->next = ptr; 4 F9 Z3 n3 F9 Q" K ptr->next = NULL; 3 m. d+ X4 Z" c6 ]1 D! j7 c } } }

void stinsort(Lpoly *pa) - a+ ^2 p. k6 D4 s! V{ Lpoly *p, *h, *q, *k; ! x4 N b8 s/ X. Y h = pa; p = k = h->next; $ z7 S" D4 y! [6 D3 t* ? q = p->next; while (p->next != NULL) { ) }4 W2 B; o: ~+ m0 K9 M% Q* L4 f if (q->exp) / r5 o: s* ^, s) A { while(q->exp > k->exp) 6 a$ M8 I- u* L7 h { k = k->next; ' x# |% m' }/ K3 R/ Z h = h->next; } if(q->exp) 6 {: M3 t Y4 M4 | { # A. u! I5 y6 f2 q7 m p->next = q->next; h->next = q; q->next = k; q = p->next; 2 z% v5 ~, ~+ o: Z8 U$ a% ~4 A% \ } 5 z8 D+ f8 G" z8 p3 d if (q->exp = k->exp) " I0 F/ h3 h) {8 V( V A" g4 c5 m { ) l Q3 Y. w# N6 T: C k->coef = k->coef + q->coef; ( j8 Q: y- V- y5 K* A q p->next = q->next; * w H% h' f4 L4 h. W* \) H% V% l q = p->next; $ }& D% q. \% D! e/ f } h=pa; k = h->next; . a0 y, A4 z1 f5 Q3 J1 w8 }1 z5 C& P } if (q->exp = p->exp) # l* h4 G9 s% q$ T# [ { 5 M6 Z0 O4 d6 P7 E0 Q: w+ @, ` p->coef = p->coef + q->coef; p->next = q->next; q = p->next; 8 N) P- Q1 z! I* Q' [" U } if (q->exp > p->exp) { q = q->next; p = p->next; } 3 p, {" C+ v7 W9 m } * ^7 O6 g% J, Y5 @}

main() { $ p6 n, p6 e1 M. X+ T/ Z+ P int i, j = 0; & L; C4 C ^4 o$ \( I printf("a="); & y B, a, l' a- E- c! @% w scanf("%s", a); j = strlen(a);

input(a, j); stinsort(pa); . p# l* }+ f# O& m) |7 O; ] printf("a="); for (i = 0; i <= j + 10; i ++) . r/ D, Q; `: E { ' i! ]8 f, |$ h# p* ~; ] printf("%dx%d+", pa->coef, pa->exp); pa = pa->next; } 7 j2 v' h( ?) T5 I" A}

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

lvyan

这是上学期的数据结构课程设计
) v3 ?* \1 P' {$ u! F结果我已经弄出来了，得了个优秀,没跟大家说不好意思
/ @( k) {- u3 f1 P# V多谢大家给的意见,我现在水平还很差
# v5 C# u+ C& G. P9 k" i- @+ `至于注释都是给自己看的,发到网上的时候没改,呵呵~~~~~~

Q7

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

Eagle

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

406082496

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