用Java手写一个栈,并用这个栈计算中缀表达式,缺点是操作数只能是一位数。
一、代码
package stack;
public class Calculator {
public static void main(String[] args) {
String expression = "3+2*7-2";
ArrayStack1 numStack = new ArrayStack1(10);
ArrayStack1 operStack = new ArrayStack1(10);
int index = 0;
int num1 = 0;
int num2 = 0;
int oper = 0;
int res = 0;
char ch = ' ';
while (true) {
ch = expression.substring(index, index + 1).charAt(0);
if (operStack.isOper(ch)) {
if (!(operStack.isEmpty())) {
if(operStack.priority(ch) <= operStack.priority(operStack.peek())) {
oper = operStack.pop();
num1 = numStack.pop();
num2 = numStack.pop();
res = numStack.cal(num1, num2, oper);
numStack.push(res);
operStack.push(ch);
}else {
operStack.push(ch);
}
} else {
operStack.push(ch);
}
}else {
numStack.push(ch - 48);
}
index++;
if(index >= expression.length()) {
break;
}
}
while(true) {
if(operStack.isEmpty()) {
break;
}
num1 = numStack.pop();
num2 = numStack.pop();
oper = operStack.pop();
res = numStack.cal(num1, num2, oper);
numStack.push(res);
}
res = numStack.pop();
System.out.printf("表示式 %s = %d\n", expression, res);
}
}
class ArrayStack1 {
private int maxSize;
private int top = -1;
private int[] stack;
public ArrayStack1(int maxSize) {
this.maxSize = maxSize;
stack = new int[this.maxSize];
}
public boolean isEmpty() {
return top == -1;
}
public boolean isFull() {
return top == maxSize - 1;
}
public void push(int value) {
if (isFull()) {
System.out.println("沾满,不能添加数据");
return;
}
top++;
stack[top] = value;
}
public int peek() {
return stack[top];
}
public int pop() {
if (isEmpty()) {
throw new RuntimeException("栈空,没有数据");
}
int value = stack[top];
top--;
return value;
}
public void list() {
if (isEmpty()) {
System.out.println("栈空,没有数据");
return;
}
for (int i = top; i >= 0; i--) {
System.out.printf("stack[%d] = %d\n", i, stack[i]);
}
}
public int priority(int oper) {
if (oper == '*' || oper == '/') {
return 1;
} else if (oper == '+' || oper == '-') {
return 0;
} else {
return -1;
}
}
public boolean isOper(int val) {
return val == '+' || val == '-' || val == '*' || val == '/';
}
public int cal(int num1, int num2, int oper) {
int sum = 0;
switch (oper) {
case '+':
sum = num1 + num2;
break;
case '-':
sum = num2 - num1;
break;
case '*':
sum = num1 * num2;
break;
case '/':
sum = num2 / num1;
break;
default:
break;
}
return sum;
}
}
二、结果
表示式 3+2*7-2 = 15