|
| 1 | +package week06.expr; |
| 2 | + |
| 3 | +import java.util.ArrayList; |
| 4 | +import java.util.List; |
| 5 | +import java.util.Stack; |
| 6 | + |
| 7 | +public class InfixExpr { |
| 8 | + String expr = null; |
| 9 | + |
| 10 | + public InfixExpr(String expr) { |
| 11 | + this.expr = expr; |
| 12 | + } |
| 13 | + |
| 14 | + public float evaluate() { |
| 15 | + float result = 0; |
| 16 | + |
| 17 | + Stack operandStack = new Stack(); // 运算数栈 |
| 18 | + Stack operaterStack = new Stack(); // 运算符栈 |
| 19 | + |
| 20 | + char[] exprCharArr = expr.toCharArray(); |
| 21 | + List<String> exprStringList = new ArrayList<String>(); |
| 22 | + addOperandAndOperater(exprCharArr, exprStringList); |
| 23 | + |
| 24 | + for (int i = 0; i < exprStringList.size(); i++) { |
| 25 | + if (isOperand(exprStringList.get(i))) { |
| 26 | + operandStack.push(exprStringList.get(i)); |
| 27 | + } else if (isOperater(exprStringList.get(i))) { |
| 28 | + operaterStack.push(exprStringList.get(i)); |
| 29 | + } else { |
| 30 | + throw new RuntimeException("this operater has not yet implemented."); |
| 31 | + } |
| 32 | + |
| 33 | + if (operaterStack.size() == 2) { |
| 34 | + |
| 35 | + String operater_1 = (String) operaterStack.pop(); |
| 36 | + String operater_2 = (String) operaterStack.pop(); |
| 37 | + if (hasTheSameOrHighPriority(operater_2, operater_1)) { |
| 38 | + |
| 39 | + String operand_1 = (String) operandStack.pop(); |
| 40 | + String operand_2 = (String) operandStack.pop(); |
| 41 | + operation(operandStack, operater_2, operand_1, operand_2); |
| 42 | + |
| 43 | + operaterStack.push(operater_1); |
| 44 | + } else if (hasTheLowPriority(operater_2, operater_1)) { |
| 45 | + |
| 46 | + operandStack.push(exprStringList.get(++i)); |
| 47 | + String operand_1 = (String) operandStack.pop(); |
| 48 | + String operand_2 = (String) operandStack.pop(); |
| 49 | + operation(operandStack, operater_1, operand_1, operand_2); |
| 50 | + |
| 51 | + operaterStack.push(operater_2); |
| 52 | + } |
| 53 | + } |
| 54 | + |
| 55 | + if (i == exprStringList.size() - 1) { |
| 56 | + |
| 57 | + String operater = (String) operaterStack.pop(); |
| 58 | + String operand_1 = (String) operandStack.pop(); |
| 59 | + String operand_2 = (String) operandStack.pop(); |
| 60 | + operation(operandStack, operater, operand_1, operand_2); |
| 61 | + |
| 62 | + result = (float) Integer.parseInt((String) operandStack.pop()); |
| 63 | + } |
| 64 | + } |
| 65 | + |
| 66 | + return result; |
| 67 | + } |
| 68 | + |
| 69 | + private void addOperandAndOperater(char[] exprCharArr, List<String> exprStringList) { |
| 70 | + for (int i = 0; i < exprCharArr.length; i++) { |
| 71 | + if (isOperand(exprCharArr[i])) { |
| 72 | + StringBuilder sb = new StringBuilder(); |
| 73 | + sb.append(exprCharArr[i]); |
| 74 | + if (i < exprCharArr.length - 1) { |
| 75 | + while (i < exprCharArr.length - 1 && isOperand(exprCharArr[i + 1])) { |
| 76 | + sb.append(exprCharArr[i + 1]); |
| 77 | + i++; |
| 78 | + } |
| 79 | + } |
| 80 | + exprStringList.add(sb.toString()); |
| 81 | + } else if (isOperater(exprCharArr[i])) { |
| 82 | + exprStringList.add(exprCharArr[i] + ""); |
| 83 | + } |
| 84 | + } |
| 85 | + } |
| 86 | + |
| 87 | + private boolean isOperand(char c) { |
| 88 | + return !isOperater(c); |
| 89 | + } |
| 90 | + |
| 91 | + private boolean isOperater(char c) { |
| 92 | + if (c == '+' || c == '-' || c == '*' || c == '/') { |
| 93 | + return true; |
| 94 | + } |
| 95 | + return false; |
| 96 | + } |
| 97 | + |
| 98 | + private boolean isOperand(String c) { |
| 99 | + return !isOperater(c); |
| 100 | + } |
| 101 | + |
| 102 | + // 字符串相等用equals()比较. |
| 103 | + private boolean isOperater(String c) { |
| 104 | + if (c.equals("+") || c.equals("-") || c.equals("*") || c.equals("/")) { |
| 105 | + return true; |
| 106 | + } |
| 107 | + return false; |
| 108 | + } |
| 109 | + |
| 110 | + // operater_1 has the same or high priority compare with the operater_2. |
| 111 | + private boolean hasTheSameOrHighPriority(Object operater_1, Object operater_2) { |
| 112 | + if ((operater_1.equals("+") && operater_2.equals("+")) || (operater_1.equals("+") && operater_2.equals("-")) |
| 113 | + || (operater_1.equals("-") && operater_2.equals("+")) |
| 114 | + || (operater_1.equals("-") && operater_2.equals("-")) |
| 115 | + || (operater_1.equals("*") && operater_2.equals("*")) |
| 116 | + || (operater_1.equals("*") && operater_2.equals("/")) |
| 117 | + || (operater_1.equals("/") && operater_2.equals("*")) |
| 118 | + || (operater_1.equals("/") && operater_2.equals("/")) |
| 119 | + || (operater_1.equals("*") && operater_2.equals("+")) |
| 120 | + || (operater_1.equals("*") && operater_2.equals("-")) |
| 121 | + || (operater_1.equals("/") && operater_2.equals("+")) |
| 122 | + || (operater_1.equals("/") && operater_2.equals("-"))) { |
| 123 | + return true; |
| 124 | + } |
| 125 | + return false; |
| 126 | + } |
| 127 | + |
| 128 | + //// operater_1 has the low priority compare with the operater_2. |
| 129 | + private boolean hasTheLowPriority(Object operater_1, Object operater_2) { |
| 130 | + if ((operater_1.equals("+") && operater_2.equals("*")) || (operater_1.equals("+") && operater_2.equals("/")) |
| 131 | + || (operater_1.equals("-") && operater_2.equals("*")) |
| 132 | + || (operater_1.equals("-") && operater_2.equals("/"))) { |
| 133 | + return true; |
| 134 | + } |
| 135 | + return false; |
| 136 | + } |
| 137 | + |
| 138 | + private void operation(Stack operandStack, String operater, String operand_1, String operand_2) { |
| 139 | + if (operater.equals("+")) { |
| 140 | + operandStack.push((Integer.parseInt(operand_2) + Integer.parseInt(operand_1)) + ""); |
| 141 | + } else if (operater.equals("-")) { |
| 142 | + operandStack.push((Integer.parseInt(operand_2) - Integer.parseInt(operand_1)) + ""); |
| 143 | + } else if (operater.equals("*")) { |
| 144 | + operandStack.push((Integer.parseInt(operand_2) * Integer.parseInt(operand_1)) + ""); |
| 145 | + } else if (operater.equals("/")) { |
| 146 | + operandStack.push((Integer.parseInt(operand_2) / Integer.parseInt(operand_1)) + ""); |
| 147 | + } |
| 148 | + } |
| 149 | + |
| 150 | +} |
0 commit comments