[求助]请教各位大虾

lvyan

这是我的数据结构课程设计 6 k6 W2 B+ [8 f1 W/ B0 z' G实现一个多项式合并，字符串输入多项式，链表插入排序 可是我运行出来结果不一样啊，大家帮我看下哪里错了，小的在此谢过啦~~~ ' | ^; D2 U7 a% ], k#include #include ' Q3 s% \3 k* \8 o* d#define MAXSIZE 400 char a[MAXSIZE]; typedef struct{char elem[MAXSIZE]; ; W; _: A& |# e0 J3 l8 Y# n int top; 2 A( L4 ^ O7 p5 u4 c% }1 C1 t }SqStack; 1 |! i3 t4 _8 P- r! ESqStack S; typedef struct poly {int coef; /*xishu*/ int exp; /*zhishu*/ . R: G5 t7 U1 R N2 p% N struct poly *next; # Y- I0 g, Z7 m0 s, ? }Lpoly; ! j+ w! v4 H% U- GLpoly *pa; int cf(int i) /*10^i*/ 0 _' \. s. @- k6 ]{ int c=1,j; / s$ G: S" Z# N: T8 Y5 j8 |4 L for(j=1;j<=i;j++) c=c*10; ) d3 f, K1 U# X7 k return c; ; \9 D ]5 `) P6 P/ z" x( j) D} 7 Z+ Y% a4 s* h; e! |void input(char a[],int j) $ r! L6 V; Z+ Q; A* z{ Lpoly *p,*h,*ptr; # C0 u" T" T0 R& v: f int i,k,flag=0,x=0; S.top=-1; : ~$ P( ~6 x. @2 w B2 z/ r pa=(Lpoly*)malloc(sizeof(Lpoly)); pa->coef=0;pa->exp=0; h=pa;h->next=NULL; p=h; /*jianlipa*/ for(i=0;i<=j-1;i++) {ptr=(Lpoly*)malloc(sizeof(Lpoly)); 2 \" t6 m$ t% a: l7 P: \% Y if(S.top+ q/ E: b* L7 w S; p {S.top++; 5 t+ t3 k* b, {" Y0 y S.elem[S.top]=a; ! k$ J5 b, M2 R2 {) W4 C/ _3 X } ; \7 Y2 C D6 H! X/ i% ~) k0 a# w( x if(a=='-') flag=1; if(a=='x') /*fenlixishu*/ {if(S.top==0) 2 T2 t( d( _/ N- E$ Z& G4 e- M3 r {if(flag==1) $ M7 X7 Z5 p6 e& o" d% e! C: I {ptr->coef=-1;ptr->next=NULL;} 2 S$ L1 t3 I- Y, A4 a* p else " e3 I, c$ p7 v% t {ptr->coef=1;ptr->next=NULL;} 6 q" e- z6 |7 j } $ Q; a l# c* q+ K5 m else . f8 j" C" U7 x! x {for(k=S.top-1;k>=0;k--) x=x+(S.elem[k]-'0')*cf(S.top-1-k); " U) ?; N J, c ptr->coef=x;ptr->next=NULL;x=0; ! B( f0 _- n2 r# n$ K6 a8 Y/ ]5 q } 3 |% \8 x8 r" U8 {1 J4 C5 `9 \ S.top=-1;flag=0; /*clear*/ } if(a=='+'||a=='-') /*fenlizhishu*/ {if(S.top==0) ; p" k1 q; q* ~! K8 k7 t {ptr->exp=1;ptr->next=NULL;} 4 ~9 d* b. u/ o `$ ~2 ?+ o3 t5 F 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*/ S.top=-1; * Q1 d0 F0 M' h! O; E! Y* g" g } & `6 l$ }4 T D" j if(ptr->coef!=0&&ptr->exp!=0) {p->next=ptr; 0 L1 H% l" }9 O0 r p=ptr; ) ~: P7 r9 l# P5 Y. H: K } if(i==j-1) 7 h- I( v+ K% h, H5 y {if(ptr->coef==0) - |5 G# n! Q8 Z+ w {for(k=S.top;k>=0;k--) . A$ P9 f' F. d3 l& X* L4 [8 f2 ?& K; l x=x+(S.elem[k]-'0')*cf(S.top-k); ptr->coef=x;ptr->next=NULL; } else {for(k=S.top;k>=0;k--) x=x+(S.elem[k]-'0')*cf(S.top-k); ptr->exp=x;ptr->next=NULL; } , k& s2 [3 _3 m" c0 E2 `8 x# d/ P p->next=ptr;ptr->next=NULL; } } 7 [% E6 d1 S; V} void stinsort(Lpoly *pa) { Lpoly *p,*h,*q,*k; h=pa;p=K=h->next;q=p->next; , o; c' U8 m. i' g while(p->next!=NULL) {if(q->expexp) 4 k; Q3 Q E* W3 Q {while(q->exp>k->exp) 5 c; P6 P- c+ x, i- q6 v2 s {k=k->next; * z/ k9 C" H$ d7 B8 { h=h->next; } if(q->expexp) 4 k. ?1 P$ z a7 j2 r) Q {p->next=q->next; . g f, p1 A* h( ] h->next=q; q->next=k; q=p->next; 5 ~# k; F, D6 C$ m8 e8 H } if(q->exp=k->exp) {k->coef=k->coef+q->coef; 7 W, B+ h/ C/ c( R p->next=q->next; , Y( L q* z, X2 w3 m# v q=p->next; ' ]2 L) A5 f4 e5 @ F6 F" P6 v } h=pa;k=h->next; ! o4 W. j L( ]) x } if(q->exp=p->exp) 8 y$ P4 X6 M4 M$ ^- } {p->coef=p->coef+q->coef; p->next=q->next; q=p->next; & w, [; F% |& O% g } / i8 A8 d; m E" P6 E3 v2 @9 H! C if(q->exp>p->exp) {q=q->next; - z* b4 z5 _. ]9 y2 {* e: g2 I5 Z p=p->next; # P- Y% x2 |5 L/ Q5 m+ K, z) S) E } , k; O: j# W: u+ W2 D* V } 9 h' e1 G9 n0 B6 Y, v m! W3 A} , \/ Q( O7 K- x9 l0 Imain() ) h4 j6 U, e ?3 u2 X% P& ]{ int i,j=0; printf("a="); # J% N8 }+ d2 h8 v! \1 o8 B$ i4 H/ T scanf("%s",a); 8 a) o+ |# |: p' K! \( n for(i=0;i<=400;i++) & ?* T7 g- g3 z7 t. B1 n {if(a!='\0') j++;} 8 {) R% a4 t) p$ N! t6 U input(a,j); stinsort(pa); ( i) p7 F' I- q3 p3 P9 f printf("a="); for(i=0;i<=j+10;i++) % v8 e) V/ q) T5 E$ ] {printf("%dx%d+",pa->coef,pa->exp); pa=pa->next; } 2 o4 ^0 E1 I- }# b4 U}

游侠无极限

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

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

夜编程

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

夜编程

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

夜编程

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

夜编程

#include "stdlib.h" #include "string.h" % W. r8 C4 z- l8 n#include "stdio.h"

#define MAXSIZE 400 0 O9 b1 N6 i9 k8 p1 ]# _. h$ a% Gchar a[MAXSIZE];

typedef struct 9 U- |5 w, A# b T7 L: _{ char elem[MAXSIZE]; ; v! k, [3 o. Q int top; ( O8 I3 g) b7 I# A}SqStack;

SqStack S;

typedef struct poly { : X+ ?) i% q. X int coef; /*xishu*/ 9 v3 B- W; E* M" @ int exp; /*zhishu*/ struct poly *next; # t4 k% t3 A) J* F7 h! a}Lpoly;

Lpoly *pa;

int cf(int i) /*10^i*/ { int c = 1, j; for(j = 1; j <= i; j ++) c = c * 10; ' v# W! ?+ l f+ ` return c; }

void input(char a[],int j) { X4 B0 w0 A8 F. n( ^4 c, M Lpoly *p, *h, *ptr; int i, k, flag = 0, x = 0; S.top = -1; 6 b& R, l" ?9 y) b5 V$ G% s pa = (Lpoly*)malloc(sizeof(Lpoly)); pa->coef = 0; - F3 \3 f' N+ X! \' F1 @1 A pa->exp = 0; h = pa; h->next = NULL; $ G, X+ t( d/ k5 X& q8 n* ] p = h; /*jianlipa*/ & K0 j5 I0 j7 j1 T3 m5 s for (i = 0; i <= j - 1; i ++) ! `) R0 J* H0 | n+ c& N5 V) b { ptr = (Lpoly*)malloc(sizeof(Lpoly)); 2 C* S1 E/ |" k8 }6 _7 A J" f if(S.top) { S.top ++; 8 T% E+ Q3 ~% Y# f S.elem[S.top] = a; 2 L& P0 W W6 M2 o } if (a == '-') flag=1; , `' x- m9 J K4 f6 m( w if(a == 'x') /*fenlixishu*/ { $ G; Y* s* u, C6 C; f if (S.top==0) { if (flag == 1) * K3 x2 c: |0 e% C { ptr->coef = -1; 3 C P' z. h0 z, g9 e ptr->next = NULL; } else L6 m( U, ~( P { * \* }" U$ E2 E# _+ t2 I% ]+ x ptr->coef = 1; 2 v6 M3 X( h6 b3 ] ptr->next = NULL; : f L# t' E$ x* b, u& P/ h } 4 q) ?7 Z% Z" W# r! U- r, m8 d3 b6 G } 5 B& f; ^6 t9 ]: E, I9 Z else { ! D$ ?' j7 m" J- H$ z$ r7 D for (k=S.top - 1; k >= 0; k --) x = x + (S.elem[k] - '0') * cf(S.top - 1 - k); ptr->coef = x; . Z# O: K, Y( L: i ptr->next = NULL; + g% A# Q# }$ G' l- s2 w$ j x = 0; ) F9 R% B: a6 b" x- K } S.top = -1; 1 |) J+ `" i& r! P ~ flag = 0; /*clear*/ } # {: X# t. H- }' Q if (a == '+' || a == '-') /*fenlizhishu*/ { if(S.top == 0) { / q! x/ e e3 _6 c ptr->exp = 1; - S$ J1 g0 X* l1 F; F# S/ I$ V! [ ptr->next = NULL; N( S/ I1 t5 t, d9 Y } else { for (k = S.top - 1; k >= 0; k --) x = x + (S.elem[k] - '0') * cf(S.top - 1 - k); # v' w+ l/ p$ I, Y4 c( R ptr->exp = x; 9 V- H+ G; Q8 Y( b+ `& b+ ` ptr->next = NULL; x = 0; }/*tiquzhishu*/ S.top = -1; } if (ptr->coef != 0 && ptr->exp != 0) { 1 v# N$ L5 |% U1 O p->next = ptr; p = ptr; % o( v$ p8 w& \1 X3 \" p } ) q8 h" K8 w& [$ ^; `! g. `6 J if (i == j - 1) { if (ptr->coef == 0) 7 _9 F* k/ p" {) N' G) v8 a { & Q: d' a4 r$ g1 L: O& v* u for (k = S.top; k >= 0; k --) x = x + (S.elem[k] - '0') * cf(S.top - k); ptr->coef = x; z+ s6 `, I7 n8 q8 |: i9 u% V3 L ptr->next = NULL; } else 7 ]8 v% v- P$ t8 @; x0 [2 N6 Q { l, ^3 i7 E, K0 w, i0 `! s7 E for (k = S.top; k >= 0; k --) x = x + (S.elem[k] - '0') * cf(S.top - k); ptr->exp = x; ptr->next = NULL; } p->next = ptr; 7 |! Q6 ~, E# B [% z: L ptr->next = NULL; ' Q5 u& Y0 y$ q6 l } } }

void stinsort(Lpoly *pa) . i* h# \" n4 W% o) s& O0 a6 {4 H{ Lpoly *p, *h, *q, *k; ' k* ^2 G& Z. J* U# o* x h = pa; p = k = h->next; ! B7 T5 M5 T' e; l8 u) |/ G0 x q = p->next; while (p->next != NULL) { if (q->exp) { while(q->exp > k->exp) 8 ~& v! F9 F# {4 ^( o5 v% D3 A { 2 ?) O& r7 Z2 z B9 ]2 V6 F$ F k = k->next; h = h->next; 6 e4 o* [/ G! J. Z } if(q->exp) 5 F0 |) T# w$ V% C, | { p->next = q->next; h->next = q; & C, R( W! q. V% A% Q; R" j' S7 ] q->next = k; q = p->next; } % L$ o8 S' I& r. E! Z$ \1 _4 L if (q->exp = k->exp) ; d+ W# g/ H! J { k->coef = k->coef + q->coef; , X% r" Y2 }$ v; S p->next = q->next; & N+ }+ M* z1 {& F( l U! l q = p->next; } h=pa; ; h* Y( D- w3 Y O k = h->next; 6 h2 i9 @4 ^1 ^' x } / D$ R7 t, K3 k. x/ k+ C; R if (q->exp = p->exp) ' F _. y; w( B# u: b! C { p->coef = p->coef + q->coef; 8 p, m# w7 A4 c! k- c* Q9 _; {! D p->next = q->next; q = p->next; % _1 b1 x% u& Q& w6 [- @ e } h1 d* _% v, ~2 \5 o8 G- S if (q->exp > p->exp) { : G7 T2 s6 M1 w" }) H4 w q = q->next; ' ^( z2 D6 X& z- ~ p = p->next; - c$ w l$ Z0 z } } }

main() 8 X5 p; {, P R{ ' P& y/ L3 f' j6 r6 m& Z8 [ int i, j = 0; printf("a="); scanf("%s", a); j = strlen(a);

input(a, j); stinsort(pa); printf("a="); ! d( y" [6 Q5 d* ~ L% N" A9 D* | for (i = 0; i <= j + 10; i ++) 3 D% x4 r1 f9 n2 K { printf("%dx%d+", pa->coef, pa->exp); pa = pa->next; 6 z5 a1 J" h# A# |5 x2 M U } } - f+ p6 `, h5 T- ]3 v

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

lvyan

这是上学期的数据结构课程设计
结果我已经弄出来了，得了个优秀,没跟大家说不好意思
& E' }1 V$ ]/ g! I# X0 q8 S! ]多谢大家给的意见,我现在水平还很差
至于注释都是给自己看的,发到网上的时候没改,呵呵~~~~~~

Q7

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

Eagle

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

406082496

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