Solution for: Evaluate reverse polish notation

Author: edyluisrey

src/leetcode/EvaluateReversePolishNotation.java

@@ -12,31 +12,31 @@ public static void main(String[] args) {
 	}
 
 	public int evalRPN(String[] tokens) {
-        if(tokens.length==0)  return 0;
-        Stack<Integer> stack = new Stack<Integer>();
-        for(int i=0; i< tokens.length; i++){
-        	if(tokens[i].equals("+") || tokens[i].equals("-") || tokens[i].equals("*")  || tokens[i].equals("/") ){
-        		int re=0;
-        		int temp= stack.pop();
-        		if(tokens[i].equals("+")){
-        		   re= stack.pop()+ temp;
-        		}
-        		if(tokens[i].equals("/")){
-         		   re= stack.pop()/temp;
-         		}
-        		if(tokens[i].equals("*")){
-         		   re= stack.pop()*temp;
-         		}
-        		if(tokens[i].equals("-")){
-         		   re= stack.pop()- temp;
-         		}  
-        		stack.push(re);
-        	}else{
-        		stack.push(Integer.parseInt(tokens[i]));
-        	}
-        }
-        
-        return stack.peek();
+		if(tokens.length==0)  return 0;
+		Stack<Integer> stack = new Stack<Integer>();
+		for(int i=0; i< tokens.length; i++){
+			if(tokens[i].equals("+") || tokens[i].equals("-") || tokens[i].equals("*")  || tokens[i].equals("/") ){
+				int re=0;
+				int temp= stack.pop();
+				if(tokens[i].equals("+")){
+				   re= stack.pop()+ temp;
+				}
+				if(tokens[i].equals("/")){
+				   re= stack.pop()/temp;
+				}
+				if(tokens[i].equals("*")){
+				   re= stack.pop()*temp;
+				}
+				if(tokens[i].equals("-")){
+			 		   re= stack.pop()- temp;
+			 	}  
+				stack.push(re);
+			}else{
+				stack.push(Integer.parseInt(tokens[i]));
+			}
+		}
+		
+		return stack.peek();
     }
 
 }