[求助]请教各位大虾

lvyan

这是我的数据结构课程设计 实现一个多项式合并，字符串输入多项式，链表插入排序 ; k; F! @) A& L; A- F5 p" h可是我运行出来结果不一样啊，大家帮我看下哪里错了，小的在此谢过啦~~~ #include #include #define MAXSIZE 400 / o" f" j; ?3 d; \/ E; }& y* A; {9 m7 Zchar a[MAXSIZE]; 3 _3 Z% r1 V( v. I% Xtypedef struct{char elem[MAXSIZE]; int top; }SqStack; SqStack S; ( T* A+ I) r8 F d9 K5 Itypedef struct poly {int coef; /*xishu*/ 7 `/ N' e) y5 w int exp; /*zhishu*/ struct poly *next; " Y4 v; i6 C3 U) m9 r6 j- v }Lpoly; Lpoly *pa; int cf(int i) /*10^i*/ { int c=1,j; 2 z+ Z! R) @3 |! D$ M( n for(j=1;j<=i;j++) c=c*10; return c; 0 D6 a2 B7 z3 U} % }: f" r) |; ~& Q( g/ Svoid input(char a[],int j) { Lpoly *p,*h,*ptr; int i,k,flag=0,x=0; # q3 W) c t8 E S.top=-1; R' y' {5 g! L: f% ^, y pa=(Lpoly*)malloc(sizeof(Lpoly)); pa->coef=0;pa->exp=0; h=pa;h->next=NULL; 0 ^* O4 V8 u! e4 ~$ S; S; K8 M p=h; /*jianlipa*/ 9 ]0 w, N/ C9 G) s1 I for(i=0;i<=j-1;i++) {ptr=(Lpoly*)malloc(sizeof(Lpoly)); if(S.top# z8 t1 u- |- @ U+ ^ s, o {S.top++; 4 s% _. N4 }5 y! g+ A, a6 f S.elem[S.top]=a; 8 O7 s" f4 A! o" a } if(a=='-') flag=1; / v F P ?4 @. A' s1 M if(a=='x') /*fenlixishu*/ 1 ^2 ^. c! G8 l! |4 V {if(S.top==0) {if(flag==1) {ptr->coef=-1;ptr->next=NULL;} else ! s6 ~, ~( S" R1 E! ` {ptr->coef=1;ptr->next=NULL;} & T/ B% D' W. V: l } else {for(k=S.top-1;k>=0;k--) x=x+(S.elem[k]-'0')*cf(S.top-1-k); 4 w- a& t7 J, _2 M7 j2 ^ [# [/ P5 W ptr->coef=x;ptr->next=NULL;x=0; ' y8 J5 r b3 [# I } 0 ~5 K+ }9 q; x$ {* c- E9 p S.top=-1;flag=0; /*clear*/ & ?# ?/ O) w+ p. d9 K } 3 J- N6 O. { a if(a=='+'||a=='-') /*fenlizhishu*/ {if(S.top==0) & o- ~/ k$ A3 {6 U! y) c2 D {ptr->exp=1;ptr->next=NULL;} else 1 C; g, R; i* ]! u$ G3 g+ `* ~3 Q% F {for(k=S.top-1;k>=0;k--) x=x+(S.elem[k]-'0')*cf(S.top-1-k); # d8 Z* q u* d! Z3 V4 T B, E ptr->exp=x;ptr->next=NULL;x=0; } /*tiquzhishu*/ 8 Z9 ? Q+ h* A; }: k3 j/ a S.top=-1; ! z+ x2 \. R9 ~3 }7 [ } ( d% Q8 F+ t' R" @ if(ptr->coef!=0&&ptr->exp!=0) {p->next=ptr; 0 p( C: [6 v8 m g p=ptr; } 1 i: A1 z6 u1 H- q2 J$ e6 W7 ^ if(i==j-1) ( \4 ]4 O8 s- J/ H {if(ptr->coef==0) ) `: B% }" D- t3 V! [ {for(k=S.top;k>=0;k--) x=x+(S.elem[k]-'0')*cf(S.top-k); ( |9 X: W: H8 e ptr->coef=x;ptr->next=NULL; . n* |4 Q5 g L, ]* {* O! B% B } else {for(k=S.top;k>=0;k--) 7 W6 j2 o7 U0 a2 [: h% l4 @) L x=x+(S.elem[k]-'0')*cf(S.top-k); ptr->exp=x;ptr->next=NULL; } : o9 K( H. f. t: J6 w p->next=ptr;ptr->next=NULL; , K: r5 h4 T& J/ [; O( i7 O } } } void stinsort(Lpoly *pa) , I z0 Z8 I* F0 |+ c7 u* C{ Lpoly *p,*h,*q,*k; h=pa;p=K=h->next;q=p->next; * I$ y( B* h* H! M! Y2 d ? while(p->next!=NULL) {if(q->expexp) 7 u/ w0 o2 S0 E0 {/ X: k: O {while(q->exp>k->exp) {k=k->next; 9 Y& y7 q5 ^. z/ E1 d r. q h=h->next; } if(q->expexp) i6 K: a* y! l( i" Q, {4 W0 e, n {p->next=q->next; 6 g5 Y, v# A) z% N& @* m, A h->next=q; 4 L% {+ `5 u( q" g q->next=k; e- T9 M. [4 y8 `: [" s6 B: ~ q=p->next; } if(q->exp=k->exp) 9 }; ]2 a* J( _( X {k->coef=k->coef+q->coef; p->next=q->next; q=p->next; ) P% Z% W' C9 P5 N t, Q } h=pa;k=h->next; } A% {! z# t: c6 l# B if(q->exp=p->exp) {p->coef=p->coef+q->coef; $ x. W0 Q$ N. m/ z p->next=q->next; q=p->next; 3 } I2 u1 i5 m; o" U3 d } if(q->exp>p->exp) {q=q->next; p=p->next; ; c$ \/ z! S4 o; S/ G } / n# G' l* W1 g- h3 J A9 z, d } 7 g0 Q+ a1 L9 r} % S" B8 W$ p* l* u" @9 Mmain() # `" v3 @) _: [ \/ Y, Z4 ^6 G{ int i,j=0; $ c8 K/ {: b( i9 { printf("a="); scanf("%s",a); . E2 u( z4 [) F# S for(i=0;i<=400;i++) 9 t* q7 N- s8 c, D0 U% t- X. _ {if(a!='\0') j++;} input(a,j); stinsort(pa); 3 c7 b+ U9 n6 a1 F* l$ b' G printf("a="); for(i=0;i<=j+10;i++) {printf("%dx%d+",pa->coef,pa->exp); 6 @ j0 t+ m( k# ^! g9 q pa=pa->next; : f& F/ o% b) f9 ]- L+ a) Y } }

406082496

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

Eagle

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

Q7

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

lvyan

这是上学期的数据结构课程设计
结果我已经弄出来了，得了个优秀,没跟大家说不好意思
多谢大家给的意见,我现在水平还很差
1 d# w- m7 s, E. }- F至于注释都是给自己看的,发到网上的时候没改,呵呵~~~~~~

夜编程

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

#define MAXSIZE 400 8 Y( p2 [ u9 p( l4 _char a[MAXSIZE];

typedef struct 7 \: T7 H4 N9 T- ~/ C" F{ char elem[MAXSIZE]; int top; & I& c5 B2 e2 c% m}SqStack;

SqStack S;

typedef struct poly { 6 V8 H3 L/ K9 J/ y0 t: D+ a int coef; /*xishu*/ int exp; /*zhishu*/ 3 r/ L' X A) J5 C struct poly *next; }Lpoly;

Lpoly *pa;

int cf(int i) /*10^i*/ 7 a, F2 {. R- _2 ~{ ; `$ P4 t& R: A' ?0 T) Z8 V int c = 1, j; for(j = 1; j <= i; j ++) c = c * 10; return c; }

void input(char a[],int j) { . V, B7 s5 w4 I7 F5 q( v2 N Lpoly *p, *h, *ptr; 4 I% c8 _7 D, V. p; } int i, k, flag = 0, x = 0; ) I2 h6 I$ l( c5 c9 V/ c S.top = -1; pa = (Lpoly*)malloc(sizeof(Lpoly)); pa->coef = 0; pa->exp = 0; h = pa; h->next = NULL; 0 ^" x! K, g, V$ k p = h; /*jianlipa*/ 3 J/ g1 R9 x* `& T + d8 _! s! {. a- {5 n for (i = 0; i <= j - 1; i ++) { ( y, z; J4 z& C: ]$ E ptr = (Lpoly*)malloc(sizeof(Lpoly)); if(S.top) { $ a" e# O2 o$ O S.top ++; ) l* I0 L: q R S.elem[S.top] = a; & D* `# U" J2 V. U } if (a == '-') & O; e U' k, N; e9 V8 P/ D+ N1 _ flag=1; ' d- V6 @8 Z0 l- O3 H! b 6 X r- R, y8 K0 s% U if(a == 'x') /*fenlixishu*/ { if (S.top==0) ( r( \2 Y2 ^1 K& M { if (flag == 1) 4 @4 q: l( T! T3 i { ptr->coef = -1; ) V5 X% B# _& I! c1 }5 J ptr->next = NULL; 4 i% ? N# l/ c0 Q* P6 `, R } else { ptr->coef = 1; * W- Y9 _9 u& ]2 x ptr->next = NULL; 3 Z( Z/ ]8 b8 Z4 e' X) j } ! w8 y, ~# a" H9 `# T } else ' d4 Z, ]/ z; O7 x5 Z { 7 |/ Z" F! f* f) ^. V( x5 r( o 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; 4 |3 A# F+ I$ J" C \! K/ ? x = 0; } 7 ?# c) E% N' f% l S.top = -1; flag = 0; /*clear*/ % h1 ]) k7 p, u5 a7 E* \1 h' Y/ u0 G } if (a == '+' || a == '-') /*fenlizhishu*/ { ! b- M# E. s' o5 h: Y4 f if(S.top == 0) { , F5 }2 }" c' [+ U7 e. [ ptr->exp = 1; - a5 i9 y) |; A& u6 F$ V ptr->next = NULL; } : q/ q4 }& @. I1 \ else { - p3 ? E; M8 c/ N5 V, U for (k = S.top - 1; k >= 0; k --) \5 L4 q+ ~8 I( m) O' m% G5 M) s8 o$ K x = x + (S.elem[k] - '0') * cf(S.top - 1 - k); 8 _! d+ Z1 I# {* m7 y" j ptr->exp = x; ptr->next = NULL; x = 0; }/*tiquzhishu*/ 6 j8 Q+ |! h; A7 O1 \% z& n G S.top = -1; J; q, r: A! s. v } 5 C/ V7 B; J9 X, A% A8 l if (ptr->coef != 0 && ptr->exp != 0) { ( x( C" L6 ~) Q! s1 L p->next = ptr; p = ptr; ; f) L" a# v# l4 S' T } if (i == j - 1) / G$ L- x0 ]) J H { if (ptr->coef == 0) { for (k = S.top; k >= 0; k --) + z$ x8 N# u5 q) g/ @& W& f; |) b# x x = x + (S.elem[k] - '0') * cf(S.top - k); 9 P8 O7 {* v8 w& } ptr->coef = x; * ^+ d s' {3 C W; T& G ptr->next = NULL; 2 x" b+ w# j, {2 W ^1 B N" v } 4 ?! t0 ~1 m5 R7 Z else * Z `5 D# e5 ^1 B0 Z$ g { ( s: `) ^& g2 M z9 D' G& r for (k = S.top; k >= 0; k --) 3 {9 _ y4 _* d+ q+ B# _ z x = x + (S.elem[k] - '0') * cf(S.top - k); 6 Z' Z3 h; p% _, J; T7 u ptr->exp = x; ptr->next = NULL; 0 @' j9 v @3 q. `' t7 ?/ B } p->next = ptr; ptr->next = NULL; : B4 Z/ k; Y( o* J: k/ N9 T5 G } $ w# @- c9 _1 _$ Q* m$ p } }

void stinsort(Lpoly *pa) % c% C; m6 `8 J K5 U{ Lpoly *p, *h, *q, *k; $ F6 E$ S+ X6 C! Z7 c3 s h = pa; : j2 h) i0 W5 c2 T p = k = h->next; $ |8 s# Y( R( ]% {5 n q = p->next; while (p->next != NULL) { if (q->exp) ; G. w: Z$ q% J' E { 3 H) _8 M2 [/ h @) R while(q->exp > k->exp) { k = k->next; / h$ a/ \8 P1 r! f" l4 a; C h = h->next; } if(q->exp) - c, h. G) H/ h6 x4 P& @ { p->next = q->next; h->next = q; q->next = k; q = p->next; } : m% e! G9 `& H" F if (q->exp = k->exp) ' K3 l5 p# F# H { . m) g, v/ ]; b- z' k, @6 Z* |2 I k->coef = k->coef + q->coef; p->next = q->next; q = p->next; } h=pa; 3 b, h4 }/ l" L$ O# o k = h->next; } if (q->exp = p->exp) { p->coef = p->coef + q->coef; p->next = q->next; u2 f1 @; t @* ?0 s6 a q = p->next; } 6 Z: R! d8 N5 Q! _. z if (q->exp > p->exp) ' i h [8 A" b+ f! [7 J8 [ { 2 K" k' F; m: A. a. w+ G/ C q = q->next; U% X2 o M1 B' L6 z5 D/ f p = p->next; 4 B) F5 s& E$ s4 q! I/ {4 i8 s4 G } } }

main() { 7 K) V9 ^. P; }( _. F) E# Z int i, j = 0; printf("a="); scanf("%s", a); b5 j2 {3 Y( Q, y* a0 _. F j = strlen(a);

input(a, j); $ r/ c9 d# e3 g& B stinsort(pa); printf("a="); % O" Z g/ A5 P; r8 }: n$ ] for (i = 0; i <= j + 10; i ++) { printf("%dx%d+", pa->coef, pa->exp); pa = pa->next; 6 w. p+ D( G7 g8 ?$ _+ m. H. U } % _# d$ [ x2 S- Z} 5 K/ o2 ^5 p9 z, _7 ]$ h

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

夜编程

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

夜编程

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

夜编程

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

游侠无极限

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

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