import java.util.Stack; 
/**  
 * 利用棧，進(jìn)行四則運(yùn)算的類  
 * 用兩個(gè)棧來實(shí)現(xiàn)算符優(yōu)先，一個(gè)棧用來保存需要計(jì)算的數(shù)據(jù)numStack,一個(gè)用來保存計(jì)算優(yōu)先符priStack  
 *  
 * 基本算法實(shí)現(xiàn)思路為：用當(dāng)前取得的運(yùn)算符與priStack棧頂運(yùn)算符比較優(yōu)先級(jí)：若高于，則因?yàn)闀?huì)先運(yùn)算，放入棧頂；  
 * 若等于，因?yàn)槌霈F(xiàn)在后面，所以會(huì)后計(jì)算，所以棧頂元素出棧，取出操作數(shù)運(yùn)算；  
 * 若小于，則同理，取出棧頂元素運(yùn)算，將結(jié)果入操作數(shù)棧。各個(gè)優(yōu)先級(jí)'(' > '*' = '/' > '+' = '-' > ')'  
 *  
 */   
public class Operate {   
  private Stack<Character> priStack = new Stack<Character>();// 操作符棧   
  private Stack<Integer> numStack = new Stack<Integer>();;// 操作數(shù)棧   
   
  /**  
   * 傳入需要解析的字符串，返回計(jì)算結(jié)果(此處因?yàn)闀r(shí)間問題，省略合法性驗(yàn)證)  
   * @param str 需要進(jìn)行技術(shù)的表達(dá)式  
   * @return 計(jì)算結(jié)果  
   */   
  public int caculate(String str) {   
    // 1.判斷string當(dāng)中有沒有非法字符   
    String temp;// 用來臨時(shí)存放讀取的字符   
    // 2.循環(huán)開始解析字符串，當(dāng)字符串解析完，且符號(hào)棧為空時(shí)，則計(jì)算完成   
    StringBuffer tempNum = new StringBuffer();// 用來臨時(shí)存放數(shù)字字符串(當(dāng)為多位數(shù)時(shí))   
    StringBuffer string = new StringBuffer().append(str);// 用來保存，提高效率   
   
    while (string.length() != 0) {   
      temp = string.substring(0, 1);   
      string.delete(0, 1);   
      // 判斷temp，當(dāng)temp為操作符時(shí)   
      if (!isNum(temp)) {   
        // 1.此時(shí)的tempNum內(nèi)即為需要操作的數(shù)，取出數(shù)，壓棧，并且清空tempNum   
        if (!"".equals(tempNum.toString())) {   
          // 當(dāng)表達(dá)式的第一個(gè)符號(hào)為括號(hào)   
          int num = Integer.parseInt(tempNum.toString());   
          numStack.push(num); 
          tempNum.delete(0, tempNum.length());   
        }   
        // 用當(dāng)前取得的運(yùn)算符與棧頂運(yùn)算符比較優(yōu)先級(jí)：若高于，則因?yàn)闀?huì)先運(yùn)算，放入棧頂；若等于，因?yàn)槌霈F(xiàn)在后面，所以會(huì)后計(jì)算，所以棧頂元素出棧，取出操作數(shù)運(yùn)算；   
        // 若小于，則同理，取出棧頂元素運(yùn)算，將結(jié)果入操作數(shù)棧。   
   
        // 判斷當(dāng)前運(yùn)算符與棧頂元素優(yōu)先級(jí)，取出元素，進(jìn)行計(jì)算(因?yàn)閮?yōu)先級(jí)可能小于棧頂元素，還小于第二個(gè)元素等等，需要用循環(huán)判斷)   
        while (!compare(temp.charAt(0)) && (!priStack.empty())) {  
          int a = (int) numStack.pop();// 第二個(gè)運(yùn)算數(shù)   
          int b = (int) numStack.pop();// 第一個(gè)運(yùn)算數(shù)   
          char ope = priStack.pop();   
          int result = 0;// 運(yùn)算結(jié)果   
          switch (ope) {   
          // 如果是加號(hào)或者減號(hào)，則   
          case '+':   
            result = b + a;   
            // 將操作結(jié)果放入操作數(shù)棧   
            numStack.push(result);   
            break;   
          case '-':   
            result = b - a;   
            // 將操作結(jié)果放入操作數(shù)棧   
            numStack.push(result);   
            break;   
          case '*':   
            result = b * a;   
            // 將操作結(jié)果放入操作數(shù)棧   
            numStack.push(result);   
            break;   
          case '/':   
            result = b / a;// 將操作結(jié)果放入操作數(shù)棧   
            numStack.push(result);   
            break;   
          }   
   
        }   
        // 判斷當(dāng)前運(yùn)算符與棧頂元素優(yōu)先級(jí)， 如果高，或者低于平，計(jì)算完后，將當(dāng)前操作符號(hào)，放入操作符棧   
        if (temp.charAt(0) != '#') {   
          priStack.push(new Character(temp.charAt(0)));   
          if (temp.charAt(0) == ')') {// 當(dāng)棧頂為'('，而當(dāng)前元素為')'時(shí)，則是括號(hào)內(nèi)以算完，去掉括號(hào)   
            priStack.pop();   
            priStack.pop();   
          }   
        }   
      } else   
        // 當(dāng)為非操作符時(shí)（數(shù)字）   
        tempNum = tempNum.append(temp);// 將讀到的這一位數(shù)接到以讀出的數(shù)后(當(dāng)不是個(gè)位數(shù)的時(shí)候)   
    }   
    return numStack.pop();   
  }   
   
  /**  
   * 判斷傳入的字符是不是0-9的數(shù)字  
   *  
   * @param str  
   *      傳入的字符串  
   * @return  
   */   
  private boolean isNum(String temp) {   
    return temp.matches("[0-9]");   
  }   
   
  /**  
   * 比較當(dāng)前操作符與棧頂元素操作符優(yōu)先級(jí)，如果比棧頂元素優(yōu)先級(jí)高，則返回true，否則返回false  
   *  
   * @param str 需要進(jìn)行比較的字符  
   * @return 比較結(jié)果 true代表比棧頂元素優(yōu)先級(jí)高，false代表比棧頂元素優(yōu)先級(jí)低  
   */   
  private boolean compare(char str) {   
    if (priStack.empty()) {   
      // 當(dāng)為空時(shí)，顯然 當(dāng)前優(yōu)先級(jí)最低，返回高   
      return true;   
    }   
    char last = (char) priStack.lastElement();   
    // 如果棧頂為'('顯然，優(yōu)先級(jí)最低，')'不可能為棧頂。   
    if (last == '(') {   
      return true;   
    }   
    switch (str) {   
    case '#':   
      return false;// 結(jié)束符   
    case '(':   
      // '('優(yōu)先級(jí)最高,顯然返回true   
      return true;   
    case ')':   
      // ')'優(yōu)先級(jí)最低，   
      return false;   
    case '*': {   
      // '*/'優(yōu)先級(jí)只比'+-'高   
      if (last == '+' || last == '-')   
        return true;   
      else   
        return false;   
    }   
    case '/': {   
      if (last == '+' || last == '-')   
        return true;   
      else   
        return false;   
    }   
      // '+-'為最低，一直返回false   
    case '+':   
      return false;   
    case '-':   
      return false;   
    }   
    return true;   
  }   
   
  public static void main(String args[]) {   
    Operate operate = new Operate();   
    int t = operate.caculate("(3+4*(4*10-10/2)#");    
    System.out.println(t);   
  }   
   
}  

public abstract class Stack<T> {
  public abstract boolean isEmpty();
  public abstract boolean isFull();
  public abstract T top();
  public abstract boolean push(T x);
  public abstract T pop();
  public abstract void clear();
}

public class SeqStack<T> extends Stack<T> {
  private Object[] elementData;
  private int maxTop;
  private int top;
  public SeqStack(int size) {
    this.maxTop = size - 1;
    elementData = new Object[size];
    top = -1;
  }
  @Override
  public boolean isEmpty() {
    return top == -1;
  }
  @Override
  public boolean isFull() {
    return top == maxTop - 1;
  }
  @SuppressWarnings("unchecked")
  @Override
  public T top() {
    if (top == -1) {
      System.out.println("Empty");
      return null;
    }
    return (T) elementData[top];
  }
  @Override
  public boolean push(T x) {
    if (top == maxTop) {
      System.err.println("Full");
      return false;
    }
    elementData[++top] = x;
    return true;
  }
  @SuppressWarnings("unchecked")
  @Override
  public T pop() {
    if (top == -1) {
      System.err.println("Empty");
      return null;
    }
    
    T result = (T)elementData[top];
    elementData[top] = null; //gc
    top--;
    return result;
  }
  @Override
  public void clear() {
    
    //let gc do its work
    for(int i = 0; i < top+1; i++) {
      
      elementData[i] = null;
    }
    
    top = -1;
  }
}

public class StackCalc {
  private SeqStack<Integer> stack;
  public StackCalc(int maxSize) {
    stack = new SeqStack<Integer>(maxSize);
  }
  private void pushOperand(Integer number) {
    stack.push(number);
  }
  private Number doOperate(char oper) {
    Integer right = stack.pop();
    Integer left = stack.pop();
    Integer result = null;
    if (left != null && right != null) {
      switch (oper) {
      case '+':
        result = left.intValue() + right.intValue();
        break;
      case '-':
        result = left.intValue() - right.intValue();
        break;
      case '*':
        result = left.intValue() * right.intValue();
        break;
      case '/':
        if (right.intValue() == 0) {
          System.err.println("Divide by 0");
        }
        result = left.intValue() / right.intValue();
        break;
      default:
        break;
      }
    }
    stack.push(result);
    return result;
  }
  private int icp(char c) {
    switch (c) {
    case '#':
      return 0;
    case '(':
      return 7;
    case '*':
      return 4;
    case '/':
      return 4;
    case '+':
      return 2;
    case '-':
      return 2;
    case ')':
      return 1;
    default:
      return -1;
    }
  }
  private int isp(int c) {
    switch (c) {
    case '#':
      return 0;
    case '(':
      return 1;
    case '*':
      return 5;
    case '/':
      return 5;
    case '+':
      return 3;
    case '-':
      return 3;
    case ')':
      return 7;
    default:
      return -1;
    }
  }
  public String transfer(String expression) {
    StringBuilder sb = new StringBuilder();
    SeqStack<Character> stack = new SeqStack<Character>(expression.length());
    stack.push('#');
    for (int i = 0; i < expression.length(); i++) {
      Character c = expression.charAt(i);
      if ('0' <= c && c <= '9' || 'a' <= c && c <= 'z' ||
          'A' <= c && c <= 'Z') { // digit character
        sb.append(c);
      } else { // 操作符
        if (icp(c) > isp(stack.top())) { // 進(jìn)棧
          stack.push(c);
        } else { // 出棧
          if (c == ')') {
            char ch = stack.pop();
            while (ch != '(') {
              sb.append(ch);
              ch = stack.pop();
            }
          } else {
            char ch = stack.pop();
            while (icp(c) <= isp(ch)) {
              sb.append(ch);
              ch = stack.pop();
            }
            stack.push(ch);
            stack.push(c);
          }
        }
      }
    } // end of for
    char ch = stack.pop();
    while (ch != '#') {
      
      sb.append(ch);
      ch = stack.pop();
    }
    stack.clear();    
    return sb.toString();
  }
  public Integer calc(String expression) {
    expression = transfer(expression);
    for (int i = 0; i < expression.length(); i++) {
      char c = expression.charAt(i);
      switch (c) {
      case '+':
      case '-':
      case '*':
      case '/':
        doOperate(c);
        break;
      default:
        pushOperand(new Integer(c + ""));
        break;
      }
    }
    return stack.pop();
  }
  /**
   * @param args
   */
  public static void main(String[] args) {
    StackCalc calc = new StackCalc(10);
    System.out.println(calc.calc("6/(4-2)+3*2"));
  }
}