@@ -0,0 +1,1244 @@
+import java.util.Stack;%0A%0Apublic class LeetCode0150 %7B%0A    public int evalRPN(String%5B%5D tokens) %7B%0A        if(tokens == null %7C%7C tokens.length == 0) %7B%0A            return 0;%0A        %7D%0A        Stack%3CInteger%3E stack = new Stack%3CInteger%3E();%0A        for(int i = 0; i%3C tokens.length; i++) %7B%0A            String str = tokens%5Bi%5D;%0A            if(str == %22 %22) %7B%0A                continue;%0A            %7D%0A            switch(str) %7B%0A            case %22+%22:%0A                stack.push(stack.pop() + stack.pop());%0A                break;%0A            case %22-%22:%0A                int meiosis = stack.pop();%0A                stack.push(stack.pop() - meiosis);%0A                break;%0A            case %22*%22:%0A                stack.push(stack.pop() * stack.pop());%0A                break;%0A            case %22/%22:%0A                int divisor = stack.pop();%0A                stack.push(stack.pop() / divisor);%0A                break;%0A            default:%0A                stack.push(Integer.parseInt(str));%0A            %7D%0A        %7D%0A        return stack.pop();%0A    %7D%0A%0A    public static void main(String%5B%5D args) %7B%0A        LeetCode0150 leetcode = new LeetCode0150();%0A        String%5B%5D tokens = new String%5B%5D %7B%224%22, %2213%22, %225%22, %22/%22, %22+%22%7D;%0A        System.out.println(leetcode.evalRPN(tokens));%0A    %7D%0A%7D

Add LeetCode0150.java