資源簡介
設(shè)有兩個(gè)一元多項(xiàng)式:
p(x)=p0+p1x+p2x2+···+pnxn
q(x)=q0+q1x+q2x2+···+qmxm
實(shí)現(xiàn)兩個(gè)一元多項(xiàng)式的相加。
代碼片段和文件信息
#include?“stdio.h“
#include?“math.h“
#include?“malloc.h“
#define?SIZE?20
typedef?struct?node
{
struct?node?*next;?
int?exp;???//指數(shù)
float?coef;???//每項(xiàng)系數(shù)
}PloyNode;
void?Initial(PloyNode?**ploy_first??PloyNode?**ploy_second??PloyNode?**ploy_total){
*ploy_first?=?(PloyNode?*)malloc(sizeof(PloyNode));
*ploy_second?=?(PloyNode?*)malloc(sizeof(PloyNode));
*ploy_total?=?(PloyNode?*)malloc(sizeof(PloyNode));
(*ploy_first)->next?=?NULL;
(*ploy_second)->next?=?NULL;
(*ploy_total)->next?=?NULL;
}
//插入兩個(gè)多項(xiàng)式?ploy_first?和?ploy_second?
void?Insert(int?tag??PloyNode?*ploy_first??PloyNode?*ploy_second??int?num_first??int?num_second)?{
int?j??position??exp_fir?=?0??exp_sec?=?0;
float?coef_sec?=?0.0?coef_fir?=?0.0;
if(tag?==?0){
printf(“\n請(qǐng)輸入每一項(xiàng)的系數(shù)
評(píng)論
共有 條評(píng)論