双栈算术表达式求值

算术表达式求值：

public class Evaluate
{
    public static void main(String[] args)
    {
        Stack<String> ops =new Stack<String>();
        Stack<Double> vals=new Stack<Double>();
        while(!StdIn.isEmpty())
        {
            String s=StdIn.readString();
            if      (s.equals("("))   ;
            else if (s.equals("+"))  ops.push(s);
            else if (s.equals("-"))  ops.push(s);
            else if (s.equals("*"))  ops.push(s);
            else if (s.equals("/"))  ops.push(s);
            else if (s.equals("sqrt"))  ops.push(s);
            else if(s.equals(")"))
            {
                String op=ops.pop();
                double v=vals.pop();
                if    (op.equals("+")) v=vals.pop()+v;
                else if(op.equals("-")) v=vals.pop()-v;
                else if(op.equals("*")) v=vals.pop()*v;
                else if(op.equals("/")) v=vals.pop()/v;
                else if(op.equals("sqrt")) v=Math.sqart(v);
                vals.push(v);
            }
            else vals.push(Double.parseDouble(s));
        }
     StdOut.println(vals.pop());
    }
}

标签：ops,push,equals,双栈,else,vals,pop,求值,表达式
来源： https://blog.csdn.net/qq_34741911/article/details/88838242