多项式的加法之顺序表表示.docVIP

Vc6.0 多项式的加法 顺序表表示 够详细够啰嗦 供大家参考 #includestdio.h #includestdlib.h #define max_list_size 100 typedef struct{ int *dataxi; int *datami; int length; }list_student; list_student L1; list_student L2; list_student L3; int num1; int num2; void creat1() { int i = 0; int m; int huanmi,huanxi; L1.dataxi = (int *) malloc (max_list_size * sizeof(int) ); L1.datami = (int *) malloc (max_list_size * sizeof(int) ); if ((! L1.dataxi)(! L1.datami)) { printf(未建立成！); system(PAUSE); exit(1); } L1.length = 0; printf(请输入项数：\n); scanf(%d, num1); if(num1 max_list_size - 1 || num1 0) { printf(分配失败！\n); system(PAUSE); exit(1); } printf(请输入第%d项的系数：\n, i); scanf(%d, L1.dataxi[i]); printf(请输入第%d项的幂数：\n, i); scanf(%d, L1.datami[i]); i++; L1.length++; for( ; i num1; i++) { printf(请输入第%d项的系数：\n, i); scanf(%d, L1.dataxi[i]); printf(请输入第%d项的幂数：\n, i); scanf(%d, L1.datami[i]); L1.length++; for( m = 0;m L1.length;m++) { if(L1.datami[i] != L1.datami[i-1]) { if(L1.datami[i] L1.datami[i-1]) { huanmi = L1.datami[i] + L1.datami[i-1]; L1.datami[i] = huanmi - L1.datami[i]; L1.datami[i-1] = huanmi - L1.datami[i-1]; huanxi = L1.dataxi[i-1] + L1.dataxi[i]; L1.dataxi[i] = huanxi - L1.dataxi[i]; L1.dataxi[i-1] = huanxi - L1.dataxi[i-1]; } } else { printf(该项已于之前项合并 请重新输入！\n); L1.dataxi[i-1] = L1.dataxi[i-1] + L1.dataxi[i]; i--; L1.length--; } } } } void creat2() { int i = 0; int m; int huanmi,huanxi; L2.dataxi = (int *) malloc (max_list_size * sizeof(int) ); L2.datami = (int *) malloc (max_list_size * sizeof(int) ); if ((! L2.dataxi)(! L2.datami)) { printf(未建立成！); system(PAUSE); exit(1); } L2.length = 0; printf(请输入项数：\n); scanf(%d, num2); if(num2 max_list_size - 1 || num2 0) { printf(分配失败！\n); system(PAUSE); exit(1);