代码随想录算法训练营十一天| 20. 有效的括号，1047. 删除字符串中的所有相邻重复项，150. 逆波兰表达式求值

20

Code:

class Solution {
    public boolean isValid(String s) {
        Stack<Character> st = new Stack<>();
        char ch; 
        for(int i=0; i<s.length(); i++){
            ch = s.charAt(i);
            if(ch == '('){
                st.push(')');
            }else if(ch == '['){
                st.push(']');
            }else if(ch == '{'){
                st.push('}');
            }else if(st.isEmpty() || st.peek() != ch){
                return false;
            }else{
                st.pop();
            }
        }
        return st.isEmpty();
    }
}

1047

Code:

class Solution {
    public String removeDuplicates(String s) {
        Stack<Character> st = new Stack<Character>();
        char ch;
        for(int i=0; i<s.length(); i++){
            ch = s.charAt(i);
            if(st.isEmpty() || ch != st.peek()){
                st.push(ch);
            }else{
                st.pop();
            }
        }
        String result = "";
        while(!st.isEmpty()){
            result = st.pop() + result;
        }
        return result;
    } 
}

150

Code

class Solution {
    public int evalRPN(String[] tokens) {
        Stack<Integer> st = new Stack<>();
        int first;
        int second;
        int result;
        for(String s: tokens){
            if("+".equals(s)){
                st.push(st.pop() + st.pop());
            }else if("-".equals(s)){
                st.push(st.pop() - st.pop());
            }else if("*".equals(s)){
                st.push(st.pop() * st.pop());
            }else if("/".equals(s)){
                int temp1 = st.pop();
                int temp2 = st.pop();
                st.push(temp2 / temp1);
            }else{
                st.push(Integer.parseInt(s));
            }
        }
        return st.pop();
    }
}