代码随想录算法训练营第十一天 | 20、150、1047

20. Valid Parentheses

题目链接：https://leetcode.cn/problems/valid-parentheses/

2 代码实现

class Solution {
        public boolean isValid(String s) {
                Stack<Character> deque = new Stack<>();

        for (int i = 0; i < s.length(); i++) {
            char ch = s.charAt(i);

            if (ch == '('){
                deque.push(')');
            }else if (ch == '{'){
                deque.push('}');
            }else if (ch == '['){
                deque.push(']');
            }else if (deque.isEmpty() || deque.peek() != ch){
                return false;
            }else {
                //deque.pollFirst();
                deque.pop();
            }

        }
        return deque.isEmpty();
    }
}

150. Evaluate Reverse Polish Notation

题目链接：https://leetcode.cn/problems/evaluate-reverse-polish-notation/

方法一

1 方法思想

2 代码实现

class Solution {
    public static int evalRPN(String[] tokens) {
       Stack<Integer> stack  = new Stack<>();

        stack.push(Integer.valueOf(tokens[0]));
        for (int i = 1; i < tokens.length; i++) {
            String ch = tokens[i];
            if (ch.equals("+")){
                int temp = stack.pop();
                stack.push(stack.pop() + temp);
            }else if (ch.equals("-")){
                int temp = stack.pop();
                stack.push(stack.pop() - temp);
            }else if (ch.equals("*")){
                int temp = stack.pop();
                stack.push(stack.pop() * temp);
            }else if (ch.equals("/")){
                int temp = stack.pop();
                stack.push(stack.pop() / temp);
            }else {
                stack.push(Integer.valueOf(ch));
            }

        }

        return stack.pop();


    }
}

3 复杂度分析

时间复杂度：
空间复杂度：

4 涉及到知识点

方法二

1 方法思想

2 代码实现

1047. Remove All Adjacent Duplicates In String

题目链接：https://leetcode.cn/problems/remove-all-adjacent-duplicates-in-string/

2 代码实现

class Solution {
        public String removeDuplicates(String s) {
        Deque<Character> deque = new LinkedList<>();
        for (int i = 0; i < s.length(); i++) {
            char ch = s.charAt(i);
            if (!deque.isEmpty() && ch == deque.getLast()) {
                deque.removeLast();
            } else {
                deque.addLast(ch);
            }
        }
        //StringBuilder ans = new StringBuilder();
        //while (deque.isEmpty()) {
        //    ans.append(deque.pollFirst();
        //}
        String ans = "";
        while (!deque.isEmpty()){
            ans+=deque.pollFirst();
        }
        //return new String(ans);
        return ans;
    }
}