|
| 1 | +package me.lzb.basic; |
| 2 | + |
| 3 | +import java.util.ArrayList; |
| 4 | +import java.util.List; |
| 5 | +import java.util.Stack; |
| 6 | + |
| 7 | +/** |
| 8 | + * Created by LZB on 2017/4/15. |
| 9 | + */ |
| 10 | +public class InfixExpr { |
| 11 | + |
| 12 | + |
| 13 | + private String expr; |
| 14 | + |
| 15 | + public InfixExpr(String expr) { |
| 16 | + this.expr = expr; |
| 17 | + } |
| 18 | + |
| 19 | + public float evaluate() { |
| 20 | + |
| 21 | + List<Node> list = processExpr(); |
| 22 | + |
| 23 | + Stack<String> symbolStack = new Stack<>(); |
| 24 | + Stack<Float> numberStack = new Stack<>(); |
| 25 | + |
| 26 | + boolean calLevel2 = false; |
| 27 | + for (Node n : list) { |
| 28 | + if (n.isNumber) { |
| 29 | + numberStack.push(n.number); |
| 30 | + if (calLevel2) { |
| 31 | + calculate(symbolStack, numberStack, false); |
| 32 | + calLevel2 = false; |
| 33 | + } |
| 34 | + } else { |
| 35 | + symbolStack.push(n.symbol); |
| 36 | + |
| 37 | + if (n.isLevel2()) { |
| 38 | + calLevel2 = true; |
| 39 | + } |
| 40 | + } |
| 41 | + } |
| 42 | + |
| 43 | + |
| 44 | + Stack<Float> tn = new Stack<>(); |
| 45 | + int nsize = numberStack.size(); |
| 46 | + for (int i = 0; i < nsize; i++) { |
| 47 | + tn.push(numberStack.pop()); |
| 48 | + } |
| 49 | + |
| 50 | + numberStack = tn; |
| 51 | + |
| 52 | + |
| 53 | + Stack<String> ts = new Stack<>(); |
| 54 | + int ssize = symbolStack.size(); |
| 55 | + for (int i = 0; i < ssize; i++) { |
| 56 | + ts.push(symbolStack.pop()); |
| 57 | + } |
| 58 | + |
| 59 | + symbolStack = ts; |
| 60 | + |
| 61 | + |
| 62 | + while (!symbolStack.isEmpty()) { |
| 63 | + calculate(symbolStack, numberStack, true); |
| 64 | + } |
| 65 | + |
| 66 | + |
| 67 | + return numberStack.pop(); |
| 68 | + } |
| 69 | + |
| 70 | + |
| 71 | + |
| 72 | + private List<Node> processExpr() { |
| 73 | + List<Node> list = new ArrayList<>(); |
| 74 | + char[] array = this.expr.toCharArray(); |
| 75 | + String number = ""; |
| 76 | + for (int i = 0; i < array.length; i++) { |
| 77 | + if (Character.isDigit(array[i])) { |
| 78 | + number = number + String.valueOf(array[i]); |
| 79 | + } else { |
| 80 | + Node num = new Node(Float.valueOf(number), null, true, -1); |
| 81 | + number = ""; |
| 82 | + int calLevel = "+-".indexOf(array[i]) >= 0 ? 1 : 2; |
| 83 | + Node sym = new Node(0, String.valueOf(array[i]), false, calLevel); |
| 84 | + list.add(num); |
| 85 | + list.add(sym); |
| 86 | + } |
| 87 | + } |
| 88 | + |
| 89 | + Node num = new Node(Float.valueOf(number), null, true, -1); |
| 90 | + list.add(num); |
| 91 | + return list; |
| 92 | + } |
| 93 | + |
| 94 | + |
| 95 | + private void calculate(Stack<String> symbolStack, Stack<Float> numberStack, boolean isRe) { |
| 96 | + if (symbolStack.isEmpty()) { |
| 97 | + return; |
| 98 | + } |
| 99 | + |
| 100 | + |
| 101 | + String symbole = symbolStack.pop(); |
| 102 | + |
| 103 | + float right; |
| 104 | + float left; |
| 105 | + |
| 106 | + if(isRe){ |
| 107 | + left = numberStack.pop(); |
| 108 | + right = numberStack.pop(); |
| 109 | + }else { |
| 110 | + right = numberStack.pop(); |
| 111 | + left = numberStack.pop(); |
| 112 | + } |
| 113 | + |
| 114 | + |
| 115 | + |
| 116 | + float r = calculate(symbole, left, right); |
| 117 | + |
| 118 | + numberStack.push(r); |
| 119 | + } |
| 120 | + |
| 121 | + |
| 122 | + private float calculate(String symbol, float left, float right) { |
| 123 | + if ("+".equals(symbol)) { |
| 124 | + return left + right; |
| 125 | + } |
| 126 | + |
| 127 | + if ("-".equals(symbol)) { |
| 128 | + return left - right; |
| 129 | + } |
| 130 | + |
| 131 | + if ("*".equals(symbol)) { |
| 132 | + return left * right; |
| 133 | + } |
| 134 | + |
| 135 | + if ("/".equals(symbol)) { |
| 136 | + return left / right; |
| 137 | + } |
| 138 | + |
| 139 | + return 0; |
| 140 | + } |
| 141 | + |
| 142 | + |
| 143 | + private class Node { |
| 144 | + float number; |
| 145 | + String symbol; |
| 146 | + boolean isNumber; |
| 147 | + int calLevel;//加减1,乘除2 |
| 148 | + |
| 149 | + public Node(float number, String symbol, boolean isNumber, int calLevel) { |
| 150 | + this.number = number; |
| 151 | + this.symbol = symbol; |
| 152 | + this.isNumber = isNumber; |
| 153 | + this.calLevel = calLevel; |
| 154 | + } |
| 155 | + |
| 156 | + private boolean isLevel2() { |
| 157 | + return calLevel == 2; |
| 158 | + } |
| 159 | + } |
| 160 | + |
| 161 | +} |
0 commit comments