[求助]请教各位大虾

lvyan

这是我的数据结构课程设计 2 z( J; U5 \6 F7 w实现一个多项式合并，字符串输入多项式，链表插入排序 $ B M5 M6 l3 [1 h7 j可是我运行出来结果不一样啊，大家帮我看下哪里错了，小的在此谢过啦~~~ #include #include : L2 M' {' L9 m- v: x/ N#define MAXSIZE 400 3 C/ w: Q! B. Kchar a[MAXSIZE]; 5 X- p: r" e% ~3 ~: ^typedef struct{char elem[MAXSIZE]; int top; 4 J8 L& }& b( [! S% B$ s1 g }SqStack; SqStack S; ) A' u; E, d* ?# C2 |5 a' @typedef struct poly : f0 S1 t/ Q: V9 P: @8 {+ S {int coef; /*xishu*/ ! [! |9 ^6 e5 ` int exp; /*zhishu*/ 8 Y5 U/ u5 g" N: p# }$ s. C struct poly *next; }Lpoly; 3 l% L1 E1 d3 v; r8 n* \Lpoly *pa; int cf(int i) /*10^i*/ { int c=1,j; 4 \; M4 @; h, ~ for(j=1;j<=i;j++) c=c*10; , W0 b2 a( F, i4 Z9 K' V' G return c; } $ c8 z; g9 [0 x. Uvoid input(char a[],int j) 6 I2 _6 l; s) [{ Lpoly *p,*h,*ptr; : F+ G# |3 k3 } int i,k,flag=0,x=0; S.top=-1; + }) |) {$ j5 t7 f pa=(Lpoly*)malloc(sizeof(Lpoly)); pa->coef=0;pa->exp=0; h=pa;h->next=NULL; 8 c, V8 ?4 f- q5 K( M2 _! }# H- | u p=h; /*jianlipa*/ 1 C( m) h: Z7 S2 R5 s1 I$ d) i8 O for(i=0;i<=j-1;i++) {ptr=(Lpoly*)malloc(sizeof(Lpoly)); if(S.top+ _6 p' O" i* e. x `* h# J1 _* r {S.top++; S.elem[S.top]=a; } " c# U& X. {1 d9 U/ h ]4 p$ r- `: a if(a=='-') flag=1; % P* o% x7 z$ d' \ O; X if(a=='x') /*fenlixishu*/ {if(S.top==0) {if(flag==1) * ?- b& _. a6 j& X! S9 @ {ptr->coef=-1;ptr->next=NULL;} else 3 }1 |6 u* ?/ q6 A& \1 @. g( @ {ptr->coef=1;ptr->next=NULL;} , v/ }+ S3 q: q( z, Y+ n7 a& u } : ~7 H. s: A/ i9 `# V 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; } ! [" ~3 F- l) }- x( G$ C S.top=-1;flag=0; /*clear*/ } - Z1 ~$ a5 F# x# [& H& H' W if(a=='+'||a=='-') /*fenlizhishu*/ {if(S.top==0) & C* W+ X1 p' s B% e {ptr->exp=1;ptr->next=NULL;} T( ~, f/ Z0 w" x/ ~/ T5 J0 I else {for(k=S.top-1;k>=0;k--) x=x+(S.elem[k]-'0')*cf(S.top-1-k); & ] o8 |9 L$ l, q( {( Y6 \ ptr->exp=x;ptr->next=NULL;x=0; ! x( h8 f4 j8 p$ x1 K6 `( n } /*tiquzhishu*/ S.top=-1; 6 O3 B0 i- l! T+ n/ R } if(ptr->coef!=0&&ptr->exp!=0) {p->next=ptr; p=ptr; } if(i==j-1) {if(ptr->coef==0) / G# q/ t7 }. Q. P5 T {for(k=S.top;k>=0;k--) x=x+(S.elem[k]-'0')*cf(S.top-k); " f: H4 ^5 p* ^* P" M( }/ M ptr->coef=x;ptr->next=NULL; , s4 @8 k9 X+ r* C, l5 z, X } else # Q+ @1 f- }0 d* Y# a {for(k=S.top;k>=0;k--) x=x+(S.elem[k]-'0')*cf(S.top-k); ptr->exp=x;ptr->next=NULL; - ]6 N& }' f9 X } p->next=ptr;ptr->next=NULL; 5 z+ o' R% X; |4 i2 ~5 y$ }( e3 ^9 K+ v } } * R; ^* o* D- S( u$ O4 h0 o} # J' Z: X; E5 G p+ E* R1 }( Pvoid stinsort(Lpoly *pa) { Lpoly *p,*h,*q,*k; h=pa;p=K=h->next;q=p->next; while(p->next!=NULL) " a C' h3 T7 l( D# [" q {if(q->expexp) & `% v8 I$ w3 s4 j" J7 o% Z, V4 X {while(q->exp>k->exp) {k=k->next; h=h->next; , S/ t3 d0 }$ Q; l8 u } - e8 A# s/ b3 U* E* ` if(q->expexp) {p->next=q->next; h->next=q; 9 ~; R0 v8 j- U, E- A e7 f q->next=k; q=p->next; } & k9 J; w2 F B/ U* D if(q->exp=k->exp) {k->coef=k->coef+q->coef; # p0 K0 ~: t o( b4 p: O p->next=q->next; q=p->next; + n+ v8 f9 J8 M' U } h=pa;k=h->next; } if(q->exp=p->exp) V3 h* t6 y% ^ {p->coef=p->coef+q->coef; p->next=q->next; q=p->next; # I: G0 i# R/ W } 5 Z% G6 ^2 ?0 A0 t8 t7 l: _ if(q->exp>p->exp) 3 Y( @ r6 `% H {q=q->next; 7 `1 B0 C2 G- f, V7 |0 ]5 o# j p=p->next; # c- j4 N) ~& R& t1 ]" W9 n6 A) E" j } } ( b4 i% E! O2 K} 7 |9 H2 a. ~$ }/ L0 o5 Mmain() + o, t5 v3 U& b2 f{ int i,j=0; 5 L' `; J7 ^0 Z- R printf("a="); ( v, k2 r: E3 l* E3 Y6 b$ v scanf("%s",a); 8 h1 k' t# V7 m& l4 ^5 g: q for(i=0;i<=400;i++) {if(a!='\0') j++;} input(a,j); ! m! E) U) a: e& k' I: O; d stinsort(pa); printf("a="); ! v- c/ ^8 ~6 v' U* a2 \- }* Y: l 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" $ g! p- D( ~) U- L3 r#include "stdio.h"

#define MAXSIZE 400 char a[MAXSIZE];

typedef struct { 4 J3 s6 z& B0 B1 E8 A; G char elem[MAXSIZE]; : h5 \& u" l& ]7 x0 ?9 v; h5 w int top; }SqStack;

SqStack S;

typedef struct poly { int coef; /*xishu*/ int exp; /*zhishu*/ struct poly *next; }Lpoly;

Lpoly *pa;

int cf(int i) /*10^i*/ $ J% U- q- x% P3 Z$ p( l{ ) ], o8 l# C- { int c = 1, j; ; Z3 w) X; C3 Y; r6 L for(j = 1; j <= i; j ++) ! V! I% @# L& k o3 ^2 C1 w. q c = c * 10; ! \ R/ l: n; m4 b" j' u return c; }

void input(char a[],int j) , @) I! ~5 L N* T7 U/ ?6 J{ / b; D) R1 {0 G) d* k+ y Lpoly *p, *h, *ptr; . x& P3 z* @) C8 A* T" ~ int i, k, flag = 0, x = 0; S.top = -1; / ~& |2 M' W- w0 S7 H pa = (Lpoly*)malloc(sizeof(Lpoly)); pa->coef = 0; 7 J. P& F- b4 Z: t7 l pa->exp = 0; h = pa; ! c T+ d: i9 K( R5 Q3 a h->next = NULL; + J! v/ ]% g+ A% [) ^( A4 o p = h; /*jianlipa*/ % y6 ?0 F: E4 u6 r for (i = 0; i <= j - 1; i ++) : ] \2 t4 R: V5 V* @ { ptr = (Lpoly*)malloc(sizeof(Lpoly)); % W$ x8 j, M- g* Q if(S.top) 1 L" n' i0 ]/ ^5 K0 ]) B! G- L' C! b { S.top ++; S.elem[S.top] = a; 3 j) E% m2 ?6 O } if (a == '-') flag=1; ! @/ T5 \* K. e- H! I# r& q if(a == 'x') /*fenlixishu*/ ! B6 ^' P# G2 c- C { 7 \& k! w) n5 @7 }$ b }+ S' e& Q! I if (S.top==0) 7 r8 S( W$ {1 K7 z1 s { 6 O; M. P8 Y; ^5 l6 n- o if (flag == 1) { ptr->coef = -1; , Y6 D( l# L& k" ^ ptr->next = NULL; # j5 v \) {& u/ p } 8 z+ i( w& p6 a( H- q+ Z else F) ^- F T7 Q! Z0 A { ( H; {" Y, T6 t* `9 s ptr->coef = 1; ptr->next = NULL; } } else { ) @* O! o% c% Q for (k=S.top - 1; k >= 0; k --) / c0 S, l/ A# D" R; U x = x + (S.elem[k] - '0') * cf(S.top - 1 - k); ptr->coef = x; ptr->next = NULL; x = 0; } ' c& U% G* P8 |' p; ^4 b/ \ S.top = -1; flag = 0; /*clear*/ } 2 ~6 ?6 x, E2 y+ y# f } if (a == '+' || a == '-') /*fenlizhishu*/ { if(S.top == 0) ) l* Y8 i/ D' v/ H) I8 }- e: f { ptr->exp = 1; / b& c6 o; q) O4 ], ^. q ptr->next = NULL; } / c6 m* r$ m) t else { for (k = S.top - 1; k >= 0; k --) + k8 A; c4 @/ `4 Z5 U8 M. T x = x + (S.elem[k] - '0') * cf(S.top - 1 - k); ( z3 A# `( C$ U0 }+ x ptr->exp = x; ptr->next = NULL; x = 0; }/*tiquzhishu*/ . _( \1 m" n3 ~9 { S.top = -1; } if (ptr->coef != 0 && ptr->exp != 0) { ) G4 o' g' A+ A1 h, T& ~. s p->next = ptr; I! m& J8 V; u" s4 C" G, ]. U p = ptr; } : V. H9 r$ U3 j2 u if (i == j - 1) 2 V) s, x J, X { if (ptr->coef == 0) { ' M7 b2 n G' |9 ^ for (k = S.top; k >= 0; k --) x = x + (S.elem[k] - '0') * cf(S.top - k); ptr->coef = x; ptr->next = NULL; } else ) F" M$ H0 |) Z6 k; J2 | { 1 W2 Z$ a( A( I4 ^ for (k = S.top; k >= 0; k --) ( k; D. N3 x# P5 G8 Y+ I x = x + (S.elem[k] - '0') * cf(S.top - k); ptr->exp = x; ptr->next = NULL; } - l1 T G, n! c2 n$ n p->next = ptr; 1 a) o) q0 J/ L5 \ ptr->next = NULL; 2 d, J5 a& g9 }3 N& e } } }

void stinsort(Lpoly *pa) 6 l+ d$ b5 X4 S$ h m$ r8 T6 G: l{ Lpoly *p, *h, *q, *k; h = pa; 0 y% w0 G8 h2 I3 P- ?! O9 S p = k = h->next; q = p->next; 2 X/ g H" @ {& t- `6 B while (p->next != NULL) 8 ^" I. h" f7 o- p1 \# A { if (q->exp) & q D0 \5 `! u, U( \ { * d, C- e! Z( J7 S+ ^ while(q->exp > k->exp) 9 `7 ?3 d7 t( g3 _* I8 } { k = k->next; h = h->next; " v9 b) \% k8 _; ^ } if(q->exp) { 6 Q* ^6 e& H" G* Y' B' K1 K; { p->next = q->next; h->next = q; q->next = k; - r; `8 x2 L( c q = p->next; } * ?/ \* c2 R% B; g if (q->exp = k->exp) : n* T: x0 O# K, c2 u3 w/ R { + @( u5 c4 _6 L+ @ k->coef = k->coef + q->coef; p->next = q->next; 3 Y1 ~0 x0 M$ J& ?3 P, J1 | q = p->next; * ?) q6 F0 g0 y d } . F( R" x6 D7 v- K W" |- S1 C h=pa; - y& U1 W0 S( R: G/ g k = h->next; , e( q1 r2 e( N! G5 o# P) |) c3 y ] } - }- U: Z! `: {# Q' [8 v; E if (q->exp = p->exp) 5 \! h" a B$ W0 ? { p->coef = p->coef + q->coef; p->next = q->next; # N9 a0 O' e2 {% F/ k q = p->next; } ( A) P$ d3 z8 ?; \9 \ if (q->exp > p->exp) { - B$ e% C$ V5 s1 K) m q = q->next; 0 Q4 }0 a+ ^- ~4 {. u: a/ q p = p->next; 0 T/ ]& P- Q/ } } 3 `! B e4 n2 C' _ } % l# E$ i# n# t5 B: p3 F}

main() 0 I- v7 H( ?$ h1 \' G t{ . n/ x; L3 ^6 K; Q$ y# D: ^& ^ int i, j = 0; k7 ^7 ^' o0 r# p% k8 M printf("a="); 2 H! x7 v" P2 ~ b& i5 y0 w scanf("%s", a); # d+ g- ~" [/ K- W1 Y j = strlen(a);

input(a, j); stinsort(pa); printf("a="); ; }7 q/ H" T9 R. c" E% l$ { for (i = 0; i <= j + 10; i ++) ) ^6 H7 [) N3 K# k) C% Q { 2 ^: C' r- L- m' d6 v/ l* ] printf("%dx%d+", pa->coef, pa->exp); pa = pa->next; * W' C# Q* ?! R3 U. ?( Z } 3 N% D; i; V$ F- N" r5 [} ; q/ i' b% f' a

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

lvyan

这是上学期的数据结构课程设计
结果我已经弄出来了，得了个优秀,没跟大家说不好意思
& E) k% c# T& J% d( M% L( l多谢大家给的意见,我现在水平还很差
至于注释都是给自己看的,发到网上的时候没改,呵呵~~~~~~

Q7

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

Eagle

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

406082496

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