重拾编程之路--jeetcode(java)--Evaluate Reverse Polish Notation(计算逆序波兰表达式）

package com.lulu.leetcode;

import java.util.Stack;

/**
 * 逆波兰表达式求值
 * 思路：
 * 遇到变量或数字直接入栈；
 * 遇到操作符计算栈顶两个元素的值,结果入栈
 * @author lulu
 *
 */
public class C_evalRPN{
	public int evalRPN(String[] tokens) {
		if (tokens == null)
			return 0;
		Stack<String> stack = new Stack<String>();
		int result = 0;
		for (int i = 0; i < tokens.length; i++) {
			String ch = tokens[i];
			// char c[]=temp.toCharArray();
			// char ch=c[0];
			int num1 = 0;
			int num2 = 0;
			switch (ch) {
			case "+":
				num2 = Integer.parseInt(stack.pop());
				num1 = Integer.parseInt(stack.pop());
				result = num1 + num2;
				stack.push(result+"");
				break;
			case "-":
				num2 = Integer.parseInt(stack.pop());
				num1 = Integer.parseInt(stack.pop());
				result = num1 - num2;
				stack.push(result+"");
				break;
			case "*":
				num2 = Integer.parseInt(stack.pop());
				num1 = Integer.parseInt(stack.pop());
				result = num1 * num2;
				stack.push(result+"");
				break;
			case "/":
				num2 = Integer.parseInt(stack.pop());
				num1 = Integer.parseInt(stack.pop());
				result = num1 / num2;
				stack.push(result+"");
				break;

			default:
				stack.push(ch);
			//	stack.isEmpty();
				break;
			}
		}
		if(!stack.isEmpty()){
			return Integer.parseInt(stack.pop());
		}
		return result;

	}
}