用栈实现简单的计算器（C语言版）

实现+，-，*，/，%，++，--，负数，（，）的功能

2022.10.9

输入的要求

1.++，--输入时必须带括号
2.输入以#结尾

具体实现：

1.+，-，*，/，%

2.++，--前置后置均为自增1，自减1

3.可以加多层括号

4.可以输入小数，且可以输入负数

5.负数后面可以带括号（如：-（-8））

#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
#include<string.h>
#define init 10
#define increase 5
//1.++，--输入时必须带括号 
//2.输入以#结尾
typedef struct SeqStack2//存运算字符的栈，后缀为2的均为字符的函数 
{
	char* pTop;
	char* pBase;
	int stacksize;
}SeqStack2;
typedef struct SeqStack1//存数字的栈，后缀为1的均为字符的函数 
{
	float* pTop;
	float* pBase;
	int stacksize;
}SeqStack1;
void InitStack1(SeqStack1& s)//初始化栈 
{
	s.pBase = (float*)malloc(sizeof(float) * init);
	if (s.pBase == NULL)exit(0);
	s.pTop = s.pBase;
	s.stacksize = init;
}
void InitStack2(SeqStack2& s)
{
	s.pBase = (char*)malloc(sizeof(char) * init);
	if (s.pBase == NULL)exit(0);
	s.pTop = s.pBase;
	s.stacksize = init;
}
void DestroyStack1(SeqStack1& s)//销毁栈 
{
	if (s.pBase != NULL)
	{
		free(s.pBase);
		s.pBase = NULL;
	}
	s.pTop = NULL;
	s.stacksize = 0;
}
void DestroyStack2(SeqStack2& s)
{
	if (s.pBase != NULL)
	{
		free(s.pBase);
		s.pBase = NULL;
	}
	s.pTop = NULL;
	s.stacksize = 0;
}
float GetTop1(SeqStack1 s)//获取栈顶元素值 
{
	if (s.pTop == s.pBase)
		return 0;
	return *(s.pTop - 1);
}
char GetTop2(SeqStack2 s)
{
	if (s.pTop == s.pBase)
		return 0;
	return *(s.pTop - 1);
}
void Push1(SeqStack1& s, float e)//入栈 
{
	if (s.pTop - s.pBase >= s.stacksize)
	{
		s.pBase = (float*)realloc(s.pBase, sizeof(float) * (s.stacksize + increase));
		if (s.pBase == NULL)
			exit(0);
		s.pTop = s.pBase + s.stacksize;
		s.stacksize += increase;
	}
	*s.pTop = e;
	s.pTop++;
}
void Push2(SeqStack2& s, char e)
{
	if (s.pTop - s.pBase >= s.stacksize)
	{
		s.pBase = (char*)realloc(s.pBase, sizeof(char) * (s.stacksize + increase));
		if (s.pBase == NULL)
			exit(0);
		s.pTop = s.pBase + s.stacksize;
		s.stacksize += increase;
	}
	*s.pTop = e;
	s.pTop++;
}
float Pop1(SeqStack1& s)//出栈 
{
	if (s.pTop == s.pBase)
		return 0;
	float e = *(s.pTop - 1);
	s.pTop--;
	return e;
}
char Pop2(SeqStack2& s)
{
	if (s.pTop == s.pBase)
		return 0;
	char e = *(s.pTop - 1);
	s.pTop--;
	return e;
}
bool isDidit(char a)//判断是否为数字 
{
	if (a >= '0' && a <= '9')
		return true;
	else
		return false;
}
char Compare(char c1, char c2)//比较符号的优先级 
{
	if (c1 == '+')
	{
		if (c2 == '+' || c2 == '-' || c2 == ')' || c2 == '#')
		{
			return 1;
		}
		else if (c2 == '*' || c2 == '/' || c2 == '(' || c2 == '%')
		{
			return 0;
		}
	}
	else if (c1 == '-')
	{
		if (c2 == '+' || c2 == '-' || c2 == ')' || c2 == '#')
		{
			return 1;
		}
		else if (c2 == '*' || c2 == '/' || c2 == '(' || c2 == '%')
		{
			return 0;
		}
	}
	else if (c1 == '*')
	{
		if (c2 == '+' || c2 == '-' || c2 == ')' || c2 == '*' || c2 == '/' || c2 == '#' || c2 == '%')
		{
			return 1;
		}
		else if (c2 == '(')
		{
			return 0;
		}
	}
	else if (c1 == '/')
	{
		if (c2 == '+' || c2 == '-' || c2 == ')' || c2 == '*' || c2 == '/' || c2 == '#' || c2 == '%')
		{
			return 1;
		}
		else if (c2 == '(')
		{
			return 0;
		}
	}
	else if (c1 == '%')
	{
		if (c2 == '+' || c2 == '-' || c2 == ')' || c2 == '*' || c2 == '/' || c2 == '#' || c2 == '%')
		{
			return 1;
		}
		else if (c2 == '(')
		{
			return 0;
		}
	}
	else if (c1 == '(')
	{
		if (c2 == '+' || c2 == '-' || c2 == '*' || c2 == '/' || c2 == '(' || c2 == '%')
		{
			return 0;
		}
		else if (c2 == ')')
		{
			return 2;
		}
	}
	if (c1 == ')')
	{
		if (c2 == '+' || c2 == '-' || c2 == ')' || c2 == '*' || c2 == '/' || c2 == '#' || c2 == '%')
		{
			return 1;
		}
	}
	if (c1 == '#')
	{
		if (c2 == '+' || c2 == '-' || c2 == '*' || c2 == '/' || c2 == '(' || c2 == '%')
		{
			return 0;
		}
		else if (c2 == '#')
		{
			return 2;
		}
	}
}
float Operate(float a, char b, float c)//运算函数 
{
	if (b == '+')
		return a + c;
	if (b == '-')
		return a - c;
	if (b == '*')
		return a * c;
	if (b == '/')
		return float(a) / float(c);
	if (b == '%' && a - int(a) > pow(10, -10) || c - int(c) > pow(10, -10))
	{
		printf("取模不是整数，错误！！");
		exit(0);
	}
	if (b == '%' && a - int(a) < pow(10, -10) && c - int(c) < pow(10, -10))
	{
		return int(a) % int(c);
	}

}
int main()
{
	SeqStack1 s1;
	SeqStack2 s2;
	InitStack1(s1);
	InitStack2(s2);
	Push2(s2, '#');
	int i = 0;
	char t = GetTop2(s2);
	char str1[150],str[150];
	double result;
	float data;
	gets(str1);
	printf("%s\n", str1);
	i = 0;
	float a, b;
	char theta;
	char ch;
	int flag=0;
	//将++，--转化为+1和-1,将负号转化为-1* 
	for (int num = 0;num < strlen(str1);num++)
	{
		if (str1[num] == '(' && str1[num + 1] == '+' && str1[num + 2] == '+' )
		{
			str[num + 1] = '1';
			str[num] = str1[num];
			str[num + 2] = str1[num + 2];
			num += 2;
		}
		else if (str1[num] == '(' && str1[num + 1] == '-' && str1[num + 2] == '-')
		{
			str[num] = '(';
			str[num + 1] = '-';
			str[num + 2] = '1';
			str[num + 3] = '+';
			for (int n = strlen(str1);n > num+3;n--)
			{
				str1[n] = str1[n - 1];
			}
			str1[num + 3] = '+';
			num += 3;
		}
		else if (str1[num] == '+' && str1[num + 1] == '+' && str1[num + 2] == ')' || str1[num] == '-' && str1[num + 1] == '-' && str1[num + 2] == ')')
		{
			str[num] = str1[num];
			str[num + 1] = '1';
			str[num + 2] = str1[num + 2];
			num += 2;
		}
		else if (str1[num] == '(' && str1[num + 1] == '-' && str1[num + 2] == '(')
		{
			str[num] = '(';
			str[num + 1] = '-';
			str[num + 2] = '1';
			str[num + 3] = '*';
			for (int n = strlen(str1)+1;n > num+3;n--)
			{
				str1[n] = str1[n - 2];
			}
			num += 3;
		}
		else if (num==0&&str1[num] == '-' && str1[num+1] == '(')
		{
			str[0] = '-';
			str[1] = '1';
			str[2] = '*';
			for (int n = strlen(str1)+1;n > num+2;n--)
			{
				str1[n] = str1[n - 2];
			}
			num += 2;
		}
		else
			str[num] = str1[num];
	}
	while (str[i - 1] != '#' || t != '#')
	{
		if (isDidit(str[i]))
		{
			float m, n = 0,p=0;
			while(str[i] >= '0' && str[i] <= '9'||str[i]=='.')//读入连续的数字 
			{
				if(str[i]=='.')
				{
					flag=1;
					i++;
					continue;
				}
				if(flag!=0)
				{
					p=pow(10,-flag)*int(str[i]-48);
					n+=p;
					flag++;
					if(str[i+1]<'0'||str[i+1]>'9')
					{
						flag=0;
					}
					i++;
					continue;
				}
				m = int(str[i] - 48);
				n = m + n * 10;
				i++;
			}
			data = float(n);
			Push1(s1, data);

		}
		else if (i == 0 && str[0] == '-')
		{
			float u,m,n=0;
			i++;
			while(str[i] >= '0' && str[i] <= '9')
			{
				m=float(str[i]-48);
				n = m + n * 10;
				i++;
			}
			u = float(n);
			Push1(s1, -u);
		}
		else if (str[i] == '(' && str[i + 1] == '-')
		{
			Push2(s2, str[i]);
			float u,m,n=0;
			i+=2;
			while(str[i] >= '0' && str[i] <= '9')
			{
				m=float(str[i]-48);
				n = m + n * 10;
				i++;
			}
			u = float(n);
			Push1(s1, -u);
		}
		//运算符操作 
		else
		{
			t = GetTop2(s2);
			ch = str[i];
			switch (Compare(t, ch))
			{
			case 0:
				Push2(s2, ch);
				i++;
				break;
			case 1:
				theta = Pop2(s2);
				a = Pop1(s1);
				b = Pop1(s1);
				Push1(s1, Operate(b, theta, a));
				break;
			case 2:
				theta = Pop2(s2);
				i++;
				break;
			default:
				break;
			}
		}
	}
	result = GetTop1(s1);
	printf("%f", result);
	DestroyStack1(s1);
	DestroyStack2(s2); 
	system("pause");
}