获取计算字符串值,如(1+3)*5+5
//package com.nowjava;//from n o w j a v a . c o m - 时代Java import java.util.ArrayList; import java.util.List; import java.util.Map; import java.util.Stack; public class Main { static public double getCalculateStringValue(String calculateString) { return calculateInversePolandExpression(getInversePolandExpression(calculateString)); } static public double getCalculateStringValue( /** * 时 代 Java - nowjava.com 提 供 **/ Map<String, String> constantMap, String calculateString) { double result = 0; for (String str : constantMap.keySet()) { calculateString = calculateString.replaceAll(str, constantMap.get(str)); } result = calculateInversePolandExpression(getInversePolandExpression(calculateString)); return result; } static private double calculateInversePolandExpression( List<String> inversePolandExpression) { double result = 0; Stack<Double> calculateStack = new Stack<Double>(); for (String str : inversePolandExpression) { if (str.equals("+") || str.equals("-") || str.equals("*") || str.equals("/")) { double t1 = Double.valueOf(calculateStack.pop()); double t2 = Double.valueOf(calculateStack.pop()); result = simpleCalculate(t2, t1, str); calculateStack.push(result); } else { calculateStack.push(Double.valueOf(str)); } } return result; } static private List<String> getInversePolandExpression( String normalExpression) { List<String> inversePolandExpression = new ArrayList<String>(); char[] normalChararray = (normalExpression + "$").toCharArray(); // Stack<String> signStack = new Stack<String>(); List<Stack<String>> signStackList = new ArrayList<Stack<String>>(); signStackList.add(signStack); // int level = 0; int pointPosition = 0; double tempNumber = 0; boolean isInInteger = true; for (int i = 0; i < normalChararray.length; i++) { char tempChar = normalChararray[i]; // if (tempChar >= '0' && tempChar <= '9') { // if (isInInteger) { tempNumber = tempNumber * 10 + (int) (tempChar - 48); } // ? else { tempNumber += (double) (tempChar - 48) * Math.pow(0.1, i - pointPosition); } } // ? else if (tempChar == '.') { isInInteger = false; pointPosition = i; } // else if (tempChar == '+' || tempChar == '-' || tempChar == '*' || tempChar == '/' || tempChar == '$') { // isInInteger = true; // ? if (tempNumber > 0) { inversePolandExpression.add(String.valueOf(tempNumber)); } // 0 tempNumber = 0; // ??? if ((tempChar == '+') || (tempChar == '-') || tempChar == '$') { while (!signStackList.get(level).isEmpty()) { // inversePolandExpression.add(signStackList .get(level).pop()); } } // ? signStackList.get(level).push(tempChar + ""); } else if (tempChar == '(') { signStack = new Stack<String>(); signStackList.add(signStack); level++; } else if (tempChar == ')') { // isInInteger = true; // ? if (tempNumber > 0) { inversePolandExpression.add(String.valueOf(tempNumber)); } // 0 tempNumber = 0; // ???