LC.P2696[删除子串后的字符串最小长度]

发表于2024-01-10|更新于2024-01-11|LeetCode

|字数总计:110|阅读时长:1分钟|阅读量:

方法一：栈

class Solution {
    public int minLength(String s) {
        Deque<Character> stack = new ArrayDeque<>();
        stack.push(' ');
        for (int i = 0; i < s.length(); ++i) {
            char c = s.charAt(i);
            if ((c == 'B' && stack.peek() == 'A') || (c == 'D' && stack.peek() == 'C')) {
                stack.pop();
            } else {
                stack.push(c);
            }
        }
        return stack.size() - 1;
    }
}