代码随想录Day011 | Leetcode 20.有效的括号 、Leetcode 1047.删除字符串中的所有相邻重复项、Leetcode 150.逆波兰表达式求值

20.有效的括号

class Solution {
    public boolean isValid(String s) {
        String[] split = s.split("");
        Stack<String> stack = new Stack<>();
        for (int i = 0; i < split.length; i++) {
            if (("(").equals(split[i]) || ("[").equals(split[i]) || ("{").equals(split[i])) {
                stack.push(split[i]);
            } else {
                if (stack.isEmpty()) {
                    return false;
                } else {
                    String pop = stack.pop();
                    if (!((("(").equals(pop) && (")").equals(split[i]))
                            || (("[").equals(pop) && ("]").equals(split[i]))
                            || (("{").equals(pop)) && ("}").equals(split[i]))) {
                        return false;
                    }

                }
            }
        }
        if (!stack.isEmpty()) {
            return false;
        }
        return true;

    }
}

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

class Solution {
    public String removeDuplicates(String s) {
        String[] split = s.split("");
        Stack<String> stack = new Stack<>();
        for (int i = 0; i < split.length; i++) {
            if (stack.isEmpty()) {

                stack.push(split[i]);
            } else {
                String peek = stack.peek();
                if (peek.equals(split[i])) {
                    stack.pop();
                } else {
                    stack.push(split[i]);
                }
            }
        }
        StringBuilder stringBuilder = new StringBuilder();
        while (!stack.isEmpty()){
            String pop = stack.pop();
            stringBuilder.append(pop);
        }
        stringBuilder.reverse();
        return  stringBuilder.toString();
    }
}

150.逆波兰表达式求值

class Solution {
    public int evalRPN(String[] tokens) {
        Stack<Integer> stack = new Stack<>();
        for (int i = 0; i < tokens.length; i++) {
            int flag = 0;
            if (!(("+").equals(tokens[i]) || ("-").equals(tokens[i])
                    || ("*").equals(tokens[i]) || ("/").equals(tokens[i]))) {
                flag = 1;
            }
            if (stack.isEmpty() || flag == 1) {
                int num1 = Integer.parseInt(tokens[i]);
                stack.push(num1);
            } else {
                Integer pop1 = stack.pop();
                Integer pop2 = stack.pop();
                int result = 0;
                switch (tokens[i]) {
                    case "+":
                        result = pop2 + pop1;
                        break;
                    case "-":
                        result = pop2 - pop1;
                        break;
                    case "*":
                        result = pop2 * pop1;
                        break;
                    case "/":
                        if (pop1 != 0) {
                            result = pop2 / pop1;
                        }
                        break;
                }
                stack.push(result);
            }
        }
        Integer pop = stack.pop();
        return pop;
    }
}