import java.util.ArrayList;
import java.util.LinkedList;
import java.util.List;
import java.util.Stack;
public class Parser {
//解析出元素
public static List<Object> getElements(String input) {
input = input.replaceAll("\\s+", "");
List<Object> elements = new ArrayList<Object>();
int len = input.length();
for(int i=0;i<len;){
char c = input.charAt(i);
if(c>='0' && c<='9'){
int begin = i;
while (c>='0' && c<='9') {
i += 1;
if(i >= len){
break;
}
c = input.charAt(i);
}
String number = input.substring(begin,i);
elements.add(Integer.parseInt(number));
}else {
elements.add(input.charAt(i)+"");
i += 1;
}
}
return elements;
}
//转成后缀(逆波兰)形式
public static List<Object> parser(List<Object> elements) throws Exception {
List<Object> list = new LinkedList<Object>();
Stack<String> symbolStack = new Stack<String>();
for(Object element:elements){
if(element instanceof Integer){
list.add(element);
}else if(element.equals("(")){
symbolStack.push("(");
}else if(element.equals(")")){
while (true) {
String symbol = symbolStack.pop();
if(symbol.equals("(")){
break;
}
list.add(symbol);
}
}else if (element.equals("+") || element.equals("-")) {
//最低优先级,弹出所有元素,遇左括号止
while(!(symbolStack.isEmpty()) && !(symbolStack.peek().equals("("))){
list.add(symbolStack.pop());//
}
symbolStack.push((String) element);
}else if (element.equals("*") || element.equals("/")) {
//如果前一符号是+、-号,则直接入栈;不是,则直接弹出前一符号并入栈
if(symbolStack.peek().equals("+") || symbolStack.peek().equals("-")){
symbolStack.push((String) element);
}else {
list.add(symbolStack.pop());
symbolStack.push((String) element);
}
}else {
throw new Exception("不可识别字符!!");
}
}
while (!(symbolStack.isEmpty())) {
list.add(symbolStack.pop());
}
return list;
}
//求值
public static int eval(List<Object> list ) {
Stack<Integer> stack = new Stack<Integer>();
for(Object var:list){
if(var instanceof Integer){
stack.push((Integer)var);
}else if (var.equals("+")) {
stack.push(stack.pop() + stack.pop());
}else if(var.equals("-")){
int left = stack.pop();
stack.push(stack.pop() - left);
}else if(var.equals("*")){
stack.push(stack.pop() * stack.pop());
}else if (var.equals("/")) {
stack.push(stack.pop() / stack.pop());
}
}
return stack.pop();
}
public static void main(String[] args) throws Exception {
List<Object> link = getElements("3+5*((1+9)-5*4)*100");
List<Object> suffix = parser(link);
System.out.println(eval(suffix));
}
}
将中缀表达式转化为后缀表达式进行加减乘除解析求值
最新推荐文章于 2022-11-08 23:29:57 发布