evaluate-reverse-polish-notation java code

import java.util.Stack;
public class Solution {
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("/")){
if(tokens[i].equals("+")){
int temp;
int a = stack.pop();
int b = stack.pop();
temp=a+b;
stack.push(temp);
}
if(tokens[i].equals("-")){
int temp;
int b = stack.pop();
int a = stack.pop();
temp=a-b;
stack.push(temp);
}
if(tokens[i].equals("*")){
int temp;
int b = stack.pop();
int a = stack.pop();
temp=a*b;
stack.push(temp);
}
if(tokens[i].equals("/")){
int temp;
int b = stack.pop();
int a = stack.pop();
temp=a/b;
stack.push(temp);
}
}else{
stack.push(Integer.parseInt(tokens[i]));
}
}
return stack.peek();
}
}