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

Vc6.0多项式的加法顺序表表示够详细够啰嗦供大家参考#include#include#define max_list_size 100typedef structint *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.dataxii);printf(请输入第%d项的幂数：n, i); scanf(%d, &L1.datamii);i+;L1.length+; for( ; i num1; i+) printf(请输入第%d项的系数：n, i); scanf(%d, &L1.dataxii);printf(请输入第%d项的幂数：n, i); scanf(%d, &L1.datamii); L1.length+;for( m = 0;m L1.length;m+)if(L1.datamii != L1.datamii-1)if(L1.datamii max_list_size - 1 | num2 0) printf(分配失败！n);system(PAUSE); exit(1); printf(请输入第%d项的系数：n, i); scanf(%d, &L2.dataxii);printf(请输入第%d项的幂数：n, i); scanf(%d, &L2.datamii);i+;L2.length+; for( ; i num2; i+) printf(请输入第%d项的系数：n, i); scanf(%d, &L2.dataxii);printf(请输入第%d项的幂数：n, i); scanf(%d, &L2.datamii); L2.length+;for( m = 0;m L2.length;m+)if(L2.datamii != L2.datamii-1)if(L2.datamii L2.datamii-1)huanmi = L2.datamii + L2.datamii-1;L2.datamii = huanmi - L2.datamii;L2.datamii-1 = huanmi - L2.datamii-1;huanxi = L2.dataxii-1 + L2.dataxii;L2.dataxii = huanxi - L2.dataxii; L2.dataxii-1 = huanxi - L2.dataxii-1;elseprintf(该项已于之前项合并 请重新输入！);L2.dataxii-1 = L2.dataxii-1 + L2.dataxii;i-;L2.length-; void display1() int i;for( i = 1; i = L1.length; +i)printf(%4dx, L1.dataxii-1);printf(%d, L1.datamii-1);printf(%n);void display2() int i;for( i = 1; i = L2.length; +i)printf(%4dx, L2.dataxii-1);printf(%d, L2.datamii-1);printf(%n);void display3() int i;for( i = 1; i L3.length; +i)printf(%4dx, L3.dataxii-1);printf(%d, L3.datamii-1);printf(%n);void merge()int a , b , m;a = b = m = 0; L3.dataxi = (int *) malloc (max_list_size * sizeof(int) );L3.datami = (int *) malloc (max_list_size * sizeof(int) );if (! L3.dataxi)&(! L3.datami) printf(未建立成！);system(PAUSE); exit(1); L3.length = 0;while( a num1 ) & ( b num2 )if(L1.datamia != L2.datamib)if(L1.datamia L2.datamib)L3.datamim = L1.datamia; L3.dataxim = L1.dataxia ; m+;a+;L3.length+;elseL3.datamim = L2.datamib; L3.dataxim = L2.dataxib; m+;b+;L3.length+;elseL3.datamim = L1.datamia;L3.dataxim = L1.dataxia+ L2.dataxib;m+;a+;b+;L3.length+;if( a = num1)while(b = num2)L3.datamim = L2.datamib;L3.dataxim = L2.dataxib;m+;b+;L3.length+;elsewhile(a = num1)L3.datamim = L1.datamia; L3.dataxim = L1.dataxia ; m+;a+;L3.length+; int main()cre