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

20. 有效的括号

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

        return stack.isEmpty();
    }
}

1047. 删除字符串中的所有相邻重复项

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

        StringBuilder sb = new StringBuilder();
        while (!stack.isEmpty()) {
            sb.append(stack.pop());
        }
        
        return sb.reverse().toString();
    }
}

150. 逆波兰表达式求值

class Solution {
    public int evalRPN(String[] tokens) {
        Stack<Integer> stack = new Stack<>();
        int res = 0;
        for (String cur : tokens) {
            if (!cur.equals("+") && !cur.equals("-") && !cur.equals("*") && !cur.equals("/")) {
                stack.push(Integer.valueOf(cur));
            } else {
                String operator = cur;
                int num2 = Integer.valueOf(stack.pop());
                int num1 = Integer.valueOf(stack.pop());
                res = calculation (operator, num1, num2);
                stack.push(res);
            }
        }

        return Integer.valueOf(stack.pop());
    }

    public int calculation(String operator, int num1, int num2) {
        if (operator.equals("+")) {
            return num1 + num2;
        }

        if (operator.equals("-")) {
            return num1 - num2;
        }

        if (operator.equals("*")) {
            return num1 * num2;
        }


        return num1/num2;
    }
}