用栈实现计算器

用到了中缀转后缀以及后缀表达式的计算

直接贴代码~：

1. #include "stdafx.h"
2. #include <iostream>
3. #include "Calculator.h"
4. 
   
5. //构造函数
6. Calculator::Calculator()
7. {
8. m = new char[100];
9. }
10. 
    
11. //析构
12. Calculator::~Calculator()
13. {
14. }
15. //判断是不是数字
16. bool Calculator::isnum(char a)
17. {
18. if ((a >= '0') && (a <= '9'))
19. return true;
20. else
21. return false;
22. }
23. //判断是不是左括号
24. bool Calculator::isleft(char a)
25. {
26. if ((a == '('))
27. return true;
28. else
29. return false;
30. }
31. //判断是不是右括号
32. bool Calculator::isright(char a)
33. {
34. if ((a == ')'))
35. return true;
36. else
37. return false;
38. }
39. //判断是不是符号
40. bool Calculator::isOperator(char a)
41. {
42. if ((a == '+') || (a == '-') || (a == '*') || (a == '/'))
43. return true;
44. else
45. return false;
46. }
47. //比较符号的优先级
48. int Calculator::priority(char a)
49. {
50. if ((a == '+') || (a == '-'))
51. return 1;
52. 
    
53. else if ((a == '*') || (a == '/'))
54. return 2;
55. else
56. return 0;
57. }
58. //根据符号进行运算
59. int Calculator::express(int left, int right, char op)
60. {
61. int ret = 0;
62. 
    
63. switch (op)
64. {
65. case '+':
66. ret = left + right;
67. break;
68. case '-':
69. ret = left - right;
70. break;
71. case '*':
72. ret = left * right;
73. break;
74. case '/':
75. ret = left / right;
76. break;
77. default:
78. break;
79. }
80. 
    
81. return ret;
82. }
83. //将char转为int
84. int value(char c)
85. {
86. return (c - '0');
87. }
88. //总体计算函数
89. int Calculator::ret(char* a)
90. {
91. int i = 0;
92. int j = 0;
93. stack<char> n;
94. stack<int> h;
95. if (a == NULL)
96. {
97. cout << "Something wrong!..." << endl;
98. return 0;
99. }
100. while (a[i] != '\0')
101. {
102. if (isnum(a[i]))
103. {
104. m[j++] = a[i];
105. }
106. else if (isOperator(a[i]))
107. {
108. while ((n.size() != 0) && (priority(a[i]) <= priority(n.top())))
109. {
110. m[j++] = n.top();
111. n.pop();
112. }
113. n.push(a[i]);
114. }
115. else if (isleft(a[i]))
116. {
117. n.push(a[i]);
118. }
119. else if (isright(a[i]))
120. {
121. while ((n.size() != 0) && (!isleft(n.top())))
122. {
123. m[j++] = n.top();
124. n.pop();
125. }
126. n.pop();
127. }
128. else
129. {
130. cout << "Invalid expression!1" << endl;
131. break;
132. }
133. i++;
134. }
135. while ((n.size() > 0) && (a[i] == '\0'))
136. {
137. m[j++] = n.top();
138. n.pop();
139. }
140. m[j] = '\0';
141. ///前半部分进行中缀转后缀，下面是后缀算数。
142. 
     
143. i = 0;
144. j = 0;
145. int right = 0;
146. int left = 0;
147. int result = 0;
148. int ret;
150. while (m[i] != '\0')
151. {
152. if (isnum(m[i]))
153. {
154. j = value(m[i]);
155. h.push(j);
156. }
157. else if (isOperator(m[i]))
158. {
159. right = h.top();
160. h.pop();
161. left = h.top();
162. h.pop();
163. result = express(left, right, m[i]);
164. h.push(result);
165. }
166. else
167. {
168. cout << "Invalid expression!2" << endl;
169. break;
170. }
171. i++;
172. }
173. if ((h.size() == 1) && (m[i] == '\0'))
174. {
175. ret = h.top();
176. h.pop();
177. }
178. else
179. {
180. cout << "Invalid expression!2" << endl;
181. ret = 0;
182. }
183. delete m;
184. return ret;
185. }