代码随想录day11 Java版栈与队列

最新推荐文章于 2024-10-17 19:11:48 发布

qq_58958592

最新推荐文章于 2024-10-17 19:11:48 发布

阅读量384

点赞数 12

文章标签： java 算法 leetcode

本文链接：https://blog.csdn.net/qq_58958592/article/details/136423040

版权

本文介绍了三个编程题目，涉及括号的有效性检查、字符串中删除相邻重复字符以及逆波兰表达式的求值，均使用了栈数据结构进行解决方案的实现。

摘要由CSDN通过智能技术生成

力扣20 有效的括号

class Solution {
    public boolean isValid(String s) {
        Stack<Character> stack = new Stack<>();
        char[] c = s.toCharArray();
        for (int i = 0; i < s.length(); i ++) {
            if (c[i] == '[' || c[i] == '{' || c[i] == '(') {
                stack.push(c[i]);
            } else {
                if (stack.empty()) return false;
                char cc = stack.pop();
                if (cc == '(' && c[i] != ')') return false;
                if (cc == '[' && c[i] != ']') return false;
                if (cc == '{' && c[i] != '}') return false;
            }
        }
        if (stack.empty())return true;
        return false;
    }
}

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

class Solution {
    public String removeDuplicates(String s) {
        LinkedList<Character> stack = new LinkedList<>();
        for (int i = 0; i < s.length(); i ++) {
            if (stack.size() == 0) {
                stack.push(s.charAt(i));
            } else if (s.charAt(i) == stack.peek()) { 
                stack.pop();
            } else {
                stack.push(s.charAt(i));
            }
        }
        StringBuilder st = new StringBuilder();
        while (stack.size() != 0) {
            st.append(stack.pollLast());
        }
        return st.toString();
    }
}

力扣150 逆波兰表达式求值

class Solution {
    public int evalRPN(String[] tokens) {
        Stack<Integer> stack = new Stack<>();
        for (int i = 0; i < tokens.length; i ++) {
            if (tokens[i].equals("+")) {
                stack.push(stack.pop() + stack.pop());
            } else if (tokens[i].equals("-")) {
                int a = stack.pop();
                int b = stack.pop();
                stack.push(b - a);
            } else if (tokens[i].equals("*")) {
                stack.push(stack.pop() * stack.pop());
            } else if (tokens[i].equals("/")) {
                int a = stack.pop();
                int b = stack.pop();
                stack.push(b / a);
            } else {
                stack.push(Integer.parseInt(tokens[i]));
            }
        }
        return stack.pop();
    }
}