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

20. 有效的括号

力扣题目链接

class Solution {
    public boolean isValid(String s) {
        Stack<Character> stack = new Stack<>();
        char[] chars = s.toCharArray();
        for (char c : chars) {
            if (c == '{' || c == '(' || c == '[') {
                stack.push(c);
                continue;
            }
            if (stack.empty()){
                System.out.println(1);
                return false;
            }else if (stack.peek() == '{') {
                if (c == '}')
                    stack.pop();
                else {
                    System.out.println(2);
                    return false;
                }
            } else if (stack.peek() == '(') {
                if (c == ')')
                    stack.pop();
                else {
                    System.out.println(3);
                    return false;
                }
            } else if (stack.peek() == '[') {
                if (c == ']')
                    stack.pop();
                else {
                    System.out.println(4);
                    return false;
                }
            }


        }
        if (stack.empty())
            return true;
        else
            System.out.println(5);return false;
    }
}

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

力扣题目链接

public String removeDuplicates(String s) {
        char[] chars = s.toCharArray();
        Stack<Character> stack = new Stack<>();
        for (char c:chars) {
            if (stack.empty()) {
                stack.push(c);
            }else {
                if(stack.peek() == c)
                    stack.pop();
                else
                    stack.push(c);
            }

        }
        Character[] characters = new Character[stack.size()];
        stack.toArray(characters);
        String ss = "";
        for (Character c:characters) {
            ss +=c;
            
        }
        return ss;

    }

150. 逆波兰表达式求值

力扣题目链接

public int evalRPN(String[] tokens) {
        Stack<Integer> stack1 = new Stack<>();
        for (String s:tokens) {
            if(s.equals("+") || s.equals("-") || s.equals("*") || s.equals("/")){
                int a = stack1.pop();
                int b = stack1.pop();
                switch (s){
                    case "+": b+=a;break;
                    case "-": b-=a;break;
                    case "*": b*=a;break;
                    case "/": b/=a;break;
                }
                stack1.push(b);
            }
            else stack1.push(Integer.valueOf(s));
        }
        return stack1.peek();
    }