一、第一版(未参考别人)
import java.util.Deque;
import java.util.HashMap;
import java.util.LinkedList;
import java.util.Map;
/**
* v1 需求:利用栈将中缀表达式转换成后缀表达式并计算
*/
public class StackTest3 {
public static void main(String[] args) {
String i = "1+2*(9-5)";
// String i = "1*2+(9-5)";
System.out.println(calsulate(getSuffixStack(i)));
}
/**
* 获取后缀表达式
* @param input 中缀表达式
* @return
*/
public static String getSuffixStack(String input){
Deque<Character> suffixStack = new LinkedList<>(); //后缀表达式栈
Deque<Character> operationStack = new LinkedList<>(); //操作符栈
Map<String,Integer> map = new HashMap<>();
map.put("+",1);
map.put("-",1);
map.put("*",2);
map.put("/",2);
map.put("(",0);
map.put(")",0);
char[] chars = input.toCharArray(); //中缀字符串表达式转成数组
for(int i = 0; i< chars.length; i++){
if((chars[i] + "").matches("\\d")){ //如果是数字直接放入后缀表达式栈
suffixStack.push(chars[i]);
}else{
if(operationStack.isEmpty() || (chars[i]+"").equals("(")){//如果操作符栈为空或者是左括号直接放入操作符栈
operationStack.push(chars[i]);
}
//操作符大的话直接放入操作符栈
else if(operationStack.peek() != null && (map.get(operationStack.peek()+"") <= map.get(chars[i]+""))){
operationStack.push(chars[i]);
}else if(")".equals(chars[i]+"")){ //插入右括号
while(operationStack.peek() != null && !(operationStack.peek()+"").equals("(")){
suffixStack.push(operationS