shshbdhsjjd的博客

简单计算器题目描述：读入一个只包含+，-，*，/的非负整数计算表表达式，计算该表达式的值输入格式：测试输入包含若干测试用例，每个测试用例占一行，每行不超过200个字符，整数和运算符之间用一个空格分隔。没有非法表达式。当一行中只有0时输入结束，相应结果不要输出。输出格式：对每个从测试用例输出一行，即该表达式的值，精确到小数点后2位。样例输入:30 / 90 - 26 + 97 - 5 - 6 - 13 / 88 * 6 + 51 / 29 + 79 * 87 + 57 * 920样例输出;

线性表的顺序存储结构#include<iostream>using namespace std;#define MAXSIZE 100typedef struct LNode* List;typedef int ElementType; struct LNode{ ElementType Data[MAXSIZE]; int Last;};LNode L;List PtrL;//操作集//1.初始化一个空链表 List MakeEmpty();//2.在线性表中查

线性表的链式存储结构#include<iostream>using namespace std;typedef int ElementType; typedef struct LNode* List;struct LNode{ ElementType data; List Next;};LNode L;List PtrL;//线性表的链式存储的操作集//1.求表长int Length(List L); //2.查找第Kth位序的元素List FindKth(i

队列的顺序存储#include<iostream>using namespace std;#define MAXSIZE 6typedef int ElementType;typedef struct QNode* Queue;struct QNode{ ElementType Data[MAXSIZE]; int rear; int front ;};//1.入队列操作 void AddQ(ElementType item,Queue PtrQ); //2.出队列操

队列的链式存储#include<iostream>using namespace std;typedef int ElementType ;typedef struct QNode* Queue;struct Node{ ElementType Data; struct Node* Next;};struct QNode{ struct Node* rear; struct Node* front;};//1.出队列操作ElementType DeleteQ(Q

堆栈的顺序存储#include<iostream>using namespace std;#define MAXSIZE 100typedef struct SNode* Stack;typedef int ElementType;struct SNode{ ElementType Data[MAXSIZE]; int top;};//1.入栈操作void Push(ElementType item,Stack PtrS); //2.出栈操作ElementType P

堆栈的链式存储#include<iostream>using namespace std;typedef int ElementType; typedef struct SNode* Stack;struct SNode{ ElementType Data; Stack Next;}; //1.创建一个空栈Stack CreateStack(); //2.判断堆栈是否为空int IsEmpty(Stack PtrS); //3.入栈操作void Push(Eleme

02-线性结构3 Reversing Linked List (25分)Given a constant K and a singly linked list L, you are supposed to reverse the links of every K elements on L. For example, given L being 1→2→3→4→5→6, if K=3, then you must output 3→2→1→6→5→4; if K=4, you must output 4→

02-线性结构1 两个有序链表序列的合并 (15分)List Merge( List L1, List L2 ){ List L=(List)malloc(sizeof(struct Node)),temp,p,s; temp=L; L->Next=NULL; p=L1->Next; s=L2->Next; while(p&&s){ if(p->Data<=s->Data){ L->Next=p; L=p; p=p

02-线性结构2 一元多项式的乘法与加法运算 (20分)设计函数分别求两个一元多项式的乘积与和。输入格式:输入分2行，每行分别先给出多项式非零项的个数，再以指数递降方式输入一个多项式非零项系数和指数（绝对值均为不超过1000的整数）。数字间以空格分隔。输出格式:输出分2行，分别以指数递降方式输出乘积多项式以及和多项式非零项的系数和指数。数字间以空格分隔，但结尾不能有多余空格。零多项式应输出0 0。输入样例:4 3 4 -5 2 6 1 -2 03 5 20 -7 4 3 1输出样例

02-线性结构4 Pop Sequence (25分)Given a stack which can keep M numbers at most. Push N numbers in the order of 1, 2, 3, …, N and pop randomly. You are supposed to tell if a given sequence of numbers is a possible pop sequence of the stack. For example, if M is