[求助]请教各位大虾

lvyan

这是我的数据结构课程设计 6 I( ^# t: s! p- m实现一个多项式合并，字符串输入多项式，链表插入排序 3 { T/ ?- g7 f可是我运行出来结果不一样啊，大家帮我看下哪里错了，小的在此谢过啦~~~ ' _( z5 d! L, E {/ @& p; t#include #include #define MAXSIZE 400 char a[MAXSIZE]; typedef struct{char elem[MAXSIZE]; V! q! H) S% o int top; }SqStack; , C- Y) s' X' t& m- i" ~6 Z) D8 m; CSqStack S; & T* Y+ B2 j6 C! p. Dtypedef struct poly 3 A8 p; |' p9 g% N9 B0 d3 j S {int coef; /*xishu*/ int exp; /*zhishu*/ ; k5 Y+ S3 x l7 N struct poly *next; - v6 Z! ? I( t" e$ g }Lpoly; 4 P; t; X$ O, w# t5 QLpoly *pa; int cf(int i) /*10^i*/ ' |# i! Z; s1 @% s0 R5 M% Z& ~{ int c=1,j; for(j=1;j<=i;j++) c=c*10; return c; } 9 x9 B6 H: r5 k) q! c( p+ T1 \+ Zvoid input(char a[],int j) 9 b% P r4 |+ R# L4 s3 C{ Lpoly *p,*h,*ptr; int i,k,flag=0,x=0; $ N9 C7 x( k) w, R/ R1 O( U5 N+ | c S.top=-1; 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)); if(S.top/ y" w+ W7 t6 c; C/ ]4 [ {S.top++; 3 @) X# E8 V+ n5 g: K S.elem[S.top]=a; } / ~8 o0 s- L( s4 ] if(a=='-') flag=1; ; j( W0 F( p0 N0 n; N7 ~ if(a=='x') /*fenlixishu*/ 8 N T1 j6 a, A+ \3 j {if(S.top==0) 5 X4 ^) S; _- z) v {if(flag==1) ; r# i+ @5 q% F# p3 N$ x: m5 O {ptr->coef=-1;ptr->next=NULL;} else * m& F9 B! J+ h& {5 N {ptr->coef=1;ptr->next=NULL;} 9 h3 k% y7 |3 b% z, I% I0 ^ J: C } # T% K0 k8 `4 t* e7 G2 d& M* p) N else ! q; B _: R/ w! S1 l* Z {for(k=S.top-1;k>=0;k--) x=x+(S.elem[k]-'0')*cf(S.top-1-k); 0 r7 \1 S [$ ]' N4 z- {) O) _ ptr->coef=x;ptr->next=NULL;x=0; } S.top=-1;flag=0; /*clear*/ } if(a=='+'||a=='-') /*fenlizhishu*/ {if(S.top==0) - `6 i" F+ @# H3 b; ~1 H {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); 0 P d$ `; a% o6 j, N) W ptr->exp=x;ptr->next=NULL;x=0; 6 u0 A* C3 p$ G) I9 r' `" S) O: n } /*tiquzhishu*/ ) u4 C: s1 Z# U! N# _: ^4 J+ l S.top=-1; } 1 j; Q; G4 Z x1 S8 [9 \ if(ptr->coef!=0&&ptr->exp!=0) 6 h1 G3 ~; r1 t" a: T; [ {p->next=ptr; p=ptr; } if(i==j-1) : g) T p$ b( { {if(ptr->coef==0) {for(k=S.top;k>=0;k--) x=x+(S.elem[k]-'0')*cf(S.top-k); [( S1 r# \- ^; E6 Q2 Z ptr->coef=x;ptr->next=NULL; } else * Q5 M- z8 H& j, a8 z5 r: | {for(k=S.top;k>=0;k--) ; s7 j$ e- e# ]4 U x=x+(S.elem[k]-'0')*cf(S.top-k); ptr->exp=x;ptr->next=NULL; } " _7 z, ~, N7 E9 U p->next=ptr;ptr->next=NULL; } . J, h' G& Y9 {$ Z7 [, L } } + l+ m r8 b* R' V- ]% k3 }void stinsort(Lpoly *pa) 6 d. m+ X3 X) V v{ Lpoly *p,*h,*q,*k; ) @) e4 r! t# N6 s# o h=pa;p=K=h->next;q=p->next; 4 e. }& }% d! P% K: Y# K+ [' m while(p->next!=NULL) {if(q->expexp) {while(q->exp>k->exp) {k=k->next; h=h->next; } , d U( _5 X% F- s0 z; S- u# ?& i# C+ i9 S if(q->expexp) 5 R+ l- K/ s# l. `* P( T+ w {p->next=q->next; h->next=q; q->next=k; / \! d/ b( U- t( Z E q=p->next; 6 {6 N, S3 B2 Y# q3 R/ j } if(q->exp=k->exp) {k->coef=k->coef+q->coef; p->next=q->next; 8 U4 E2 u. j! O/ L) K; } q=p->next; b3 R# g" w8 z } # E) f; X. w: M; S3 B0 N4 i3 z h=pa;k=h->next; . @4 \8 K/ ~; x! @ } if(q->exp=p->exp) {p->coef=p->coef+q->coef; p->next=q->next; * r3 ? O2 k5 o q=p->next; 2 m, U5 _4 f; Z0 R, w+ e } if(q->exp>p->exp) {q=q->next; p=p->next; 4 @* _% ^+ }: b- v9 t% y$ q } ' ?; i+ H+ t5 }1 A: m8 ~ } } main() 6 U% W! V* }2 ~0 u5 [{ int i,j=0; printf("a="); scanf("%s",a); ) i8 [" }, p0 s/ P9 I( F for(i=0;i<=400;i++) # f) _& G. D/ p% p9 A/ r {if(a!='\0') j++;} input(a,j); $ S3 F- n ~5 k9 g: U* q stinsort(pa); printf("a="); : N! W& v2 {/ M* i h5 e E6 C- K( Y for(i=0;i<=j+10;i++) {printf("%dx%d+",pa->coef,pa->exp); pa=pa->next; } }

游侠无极限

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

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

夜编程

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

夜编程

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

夜编程

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

夜编程

#include "stdlib.h" - q o5 A8 ?. j: N#include "string.h" 2 h. I5 g1 t; h1 O* M#include "stdio.h"

#define MAXSIZE 400 " w6 w+ r$ t, o, V/ gchar a[MAXSIZE];

typedef struct ! ]9 ~$ M% D2 Y{ & C, ]2 |: B0 o char elem[MAXSIZE]; int top; 5 @" L% }! W9 a3 i# Z9 c6 ` f}SqStack;

SqStack S;

typedef struct poly ) D* b% h6 J( s# D( e% {: v{ int coef; /*xishu*/ int exp; /*zhishu*/ 2 I" C/ a* A6 M struct poly *next; }Lpoly;

Lpoly *pa;

int cf(int i) /*10^i*/ { . ~3 T; {" c' A! q0 B2 e Z) Q$ ? int c = 1, j; for(j = 1; j <= i; j ++) c = c * 10; return c; }

void input(char a[],int j) ( } l' @' ~2 @{ Lpoly *p, *h, *ptr; int i, k, flag = 0, x = 0; S.top = -1; 2 c( m9 ?6 R7 e pa = (Lpoly*)malloc(sizeof(Lpoly)); pa->coef = 0; pa->exp = 0; F8 P; y) g; ?, _5 ]" u8 P h = pa; h->next = NULL; 6 [, v+ n* V6 ]3 g' W* X' z) M p = h; /*jianlipa*/ ( K+ V+ H$ h- [# Q0 `2 _' N6 d ! ~ {& F7 d1 H. o W7 R# u* B) z3 T for (i = 0; i <= j - 1; i ++) { ptr = (Lpoly*)malloc(sizeof(Lpoly)); if(S.top) $ c" {2 q) z4 Q { 4 C) x, d; Y I" d2 c S.top ++; S.elem[S.top] = a; } * H5 Z; t9 q6 ]; j, F: w: P4 Z# c if (a == '-') $ p P- B1 b9 a flag=1; if(a == 'x') /*fenlixishu*/ % w, o& A- a5 o7 t { ! D0 ] i2 _& t8 s if (S.top==0) { if (flag == 1) { ptr->coef = -1; $ p% V5 z0 c( l/ q# J# K ptr->next = NULL; } else 7 r/ d [$ \5 n. _# N" r6 e J$ c { / E8 D6 h1 d# w7 O4 E9 [) M ptr->coef = 1; ptr->next = NULL; } } ' V3 E4 z6 o7 i) C else { for (k=S.top - 1; k >= 0; k --) x = x + (S.elem[k] - '0') * cf(S.top - 1 - k); ptr->coef = x; 7 v6 r/ i+ |5 P4 p9 o ptr->next = NULL; x = 0; $ L+ t9 l9 w4 O; H9 t4 D } S.top = -1; flag = 0; /*clear*/ } if (a == '+' || a == '-') /*fenlizhishu*/ ) @# B: ^2 o; {- P L { if(S.top == 0) { ptr->exp = 1; ( a: @( {/ p. o/ Q1 G! F ptr->next = NULL; " n% m! s9 c- P0 u% o$ z9 u+ h } else 1 e7 P) ]3 R, p8 C1 Z* M { * ~, H1 k$ p& E* C/ c0 p for (k = S.top - 1; k >= 0; k --) ' L1 t0 b9 @6 E E9 u x = x + (S.elem[k] - '0') * cf(S.top - 1 - k); ^ }; Y2 l1 K8 N1 T } ptr->exp = x; ptr->next = NULL; ) b( _# @7 [! v: k- K x = 0; . _7 A. G: L- q# B( U }/*tiquzhishu*/ ; q, C+ o# Y; | @8 \, j S.top = -1; # o* w" S3 O3 b6 D. ^* S+ z# B } ' T( B7 G; k# }; M9 f if (ptr->coef != 0 && ptr->exp != 0) , g! l# E' @1 I5 f* o { : w ?% p M6 @% m3 E. A, S+ J p->next = ptr; p = ptr; 3 D) H: y; T9 F0 [2 M, x! \, w } if (i == j - 1) ( W# W2 C: V/ s, j { / C: z+ r8 c- v, D( e- |# D9 O @ if (ptr->coef == 0) # ]/ X! B/ I) u8 R D { . Z0 Q* ?8 ~9 a7 G0 e for (k = S.top; k >= 0; k --) x = x + (S.elem[k] - '0') * cf(S.top - k); ptr->coef = x; ptr->next = NULL; } else { for (k = S.top; k >= 0; k --) 5 o. K( y+ |% A/ {) k, j# t x = x + (S.elem[k] - '0') * cf(S.top - k); ' M! T" p* _& x$ P: K" t1 f ptr->exp = x; ptr->next = NULL; 6 C- c: a7 Z1 s" e3 a) r7 o' Z } O( Y5 c; P& l p->next = ptr; ptr->next = NULL; . q# F& K/ R& N/ ^ } } * D* k1 _$ M1 E# R6 o8 {}

void stinsort(Lpoly *pa) { Lpoly *p, *h, *q, *k; h = pa; ; f6 j+ O U: o) w! ~ p = k = h->next; 4 g% }. R) t. ^+ D' `8 T9 l q = p->next; # q6 p" t7 m0 B- m" t while (p->next != NULL) { if (q->exp) % Q% u4 I, X' j- ` { # W; K* R# K9 V) h% R6 B+ ~2 M while(q->exp > k->exp) { k = k->next; h = h->next; , q. P" F1 x. G3 F, h } 4 O+ G' d( `' G7 m if(q->exp) 6 u) I' p- o. _' |, ? { + T$ C# y* W2 K1 E" X p->next = q->next; 4 e& y8 ?5 J8 U: G( G. a h->next = q; q->next = k; q = p->next; p9 }) T7 ~1 b Y2 p: s1 s } , ]( U# n. f( Q1 K! w4 e if (q->exp = k->exp) # x1 D7 K7 _3 M5 n+ j { k->coef = k->coef + q->coef; * G# k/ o( n, N _& s& I5 Z) m& q p->next = q->next; q = p->next; } h=pa; k = h->next; ) o: B$ F3 e; _" i: U } 6 y1 a( \, }, @ : U' k) ~- V+ d' v( w6 I" W. W if (q->exp = p->exp) 8 [) j1 o) F! L' m7 ~! z5 P- v) k/ N { . L5 U4 u* t4 n5 t9 m8 F' { p->coef = p->coef + q->coef; 7 Y# b6 W4 f v8 p p->next = q->next; ( x- x/ {% L* |5 g q = p->next; } if (q->exp > p->exp) * G' ? F! ]( r% m& X" ? { 3 s! ^9 L+ H4 @# S q = q->next; & E/ D6 |! O L9 A, ~, D p = p->next; ~2 j( [- p: p( ]3 ~ I }7 w } } }

main() { int i, j = 0; / t5 F0 S/ S5 \ printf("a="); scanf("%s", a); j = strlen(a);

input(a, j); $ ]1 k& n. {: o1 g; m$ r stinsort(pa); ! D5 c3 `# b9 B printf("a="); for (i = 0; i <= j + 10; i ++) . Z ?+ x( r' p, m* H G" | { printf("%dx%d+", pa->coef, pa->exp); & {- e5 X* g0 t: v) {. c pa = pa->next; 6 t* x+ L( Q, ], w/ l9 T7 i } 4 D" ]; g2 |+ o} ; Z; c* A- S7 H2 l

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

lvyan

这是上学期的数据结构课程设计
结果我已经弄出来了，得了个优秀,没跟大家说不好意思
! e5 [/ P3 _' S) v/ v1 }! k+ d! k多谢大家给的意见,我现在水平还很差
至于注释都是给自己看的,发到网上的时候没改,呵呵~~~~~~

Q7

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

Eagle

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

406082496

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