中缀表达式生成后缀表达式求解答案

import java.util.LinkedList;
import java.util.List;
import java.util.Scanner;
import java.util.Stack;

class Solution
{


public static void main(String[] args){
Scanner sc=new Scanner(System.in);
String s=sc.nextLine();
System.out.println(getPost(s));
System.out.println(calc(getPost(s)));
}
public static int calc(List<Character> list){
Stack<String> stack=new Stack<String>();
for(char c:list){
if(c>='0'&&c<='9'){
stack.push(c+"");
}
if(c=='+'||c=='-'||c=='*'||c=='/'){
int b=Integer.parseInt(stack.pop());
int a=Integer.parseInt(stack.pop());
if(c=='+'){stack.push(a+b+"");}
if(c=='-'){stack.push(a-b+"");}
if(c=='*'){stack.push(a*b+"");}
if(c=='/'){stack.push(a/b+"");}
}
}
return Integer.parseInt(stack.pop());
}

public static List<Character> getPost(String s){
Stack<Character> stack=new Stack<Character>();
LinkedList<Character> list=new LinkedList<Character>();
for(int i=0;i<s.length();i++){
char c=s.charAt(i);
if(c<='9'&&c>='0'){
list.add(c);
}else if(c=='+'||c=='-'||c=='*'||c=='/'){

while(!stack.isEmpty())
{
if(compare(stack.peek())>=compare(c)){
list.add(stack.pop());

}else break;
}
stack.push(c);
}else if(c=='(') stack.push(c);
else {
while(stack.peek()!='('){
list.add(stack.pop());
}
stack.pop();
}
}
while(!stack.isEmpty()){
list.add(stack.pop());
}
return list;
}
public static int compare(char c){
if(c=='+'||c=='-') return 1;
else if(c=='*'||c=='/') return 2;
else return 0;
}
}

 

 

转载于:https://www.cnblogs.com/bestzj/p/11545423.html