数据结构课内实验
实验一:
1、实验名称:一元多项式表示与实现
要求:
(1) 一元多项式的ADT定义;
(2) 存储结构描述;
(3) 一元多项式的操作实现(最低实现)
——初始化;
——一元多项式的输入,输出;
——一元多项式加减法;
(4) 实验报告要提交实现的主要代码;
2、实验名称:表达式求值
要求:
(1) 实验中要求的栈的操作自主实现;
(2) 可以按照自定义格式输入表达式;
(3) 表达式求值可以采用:原表达式求值;
(4) 若采用前缀式或者后缀式求值,可以输入前缀式或者后缀式的字符串即可。
(5) 实验报告要提交实现的主要代码;
代码实现
#include <stdio.h>
#include "stdlib.h"
typedef struct{
// The respresentation of the term, the polynomial term as the linkList's data element
float coef; // coefficient
int expn; // exponent
}elemType; // linkList's object name
typedef struct lNode{
// the single linked list storage structure for linear tables.
elemType *data; // data object
struct lNode *next; // a pointer to the next item
}lNode, *linkList;
typedef struct{
int length; // the number of the term
struct lNode *next; // apointer to the polynomial's first name.
}polynomial;
void printPattern(elemType data);
void initList(polynomial *p) {
p->next = NULL;
p->length = 0;
}
int locateElem(polynomial *p, elemType *e){
linkList cur = p->next;
if(cur == NULL){
return 0;
}
while (cur->next){
if(cur->data->expn == e->expn){
return 1;
}
cur = cur->next;
}
return 0;
}
void insFirst(polynomial *p, elemType *e){
linkList node = (linkList)malloc(sizeof(lNode));
node->next = p->next;
node->data = e;
p->next = node;
p->length++;
}
void creatPolyn2(polynomial *p, int m, const float coeff[], const int expnn[]){
initList(p);
for (int i = 0; i < m; ++i) {
elemType *e;
e = (elemType *) malloc(sizeof(elemType));
// scanf_s("%f%d", &(e->coef), &(e->expn));
e->coef = coeff[i];
e->expn = expnn[i];
if(!locateElem(p, e)){
insFirst(p, e);
}else{
free(e);
}
}
}
void creatPolyn(polynomial *p, int m){
initList(p);
for (int i = 0; i < m; ++i) {
elemType *e;
e = (elemType *) malloc(sizeof(elemType));
scanf_s("%f%d", &(e->coef), &(e->expn