代码随想录 Day10

---

232、用栈实现队列

class MyQueue {

    Stack<Integer> stackIn;
    Stack<Integer> stackOut;

    public MyQueue() {
        this.stackIn = new Stack<>();
        this.stackOut = new Stack<>();
    }

    public void push(int x) {
        stackIn.push(x);
    }

    public int pop() {
        dumpStackIn();
        return stackOut.pop();
    }

    public int peek() {
        dumpStackIn();
        return stackOut.peek();
    }

    public boolean empty() {
        return stackIn.isEmpty() && stackOut.isEmpty();
    }

    private void dumpStackIn() {
        if (!stackOut.empty()) {
            return;
        }
        while (!stackIn.empty()) {
            stackOut.push(stackIn.pop());
        }
    }
}

---

225、用队列实现栈

class MyStack {

    Queue<Integer> queue;

    public MyStack() {
        this.queue = new LinkedList<Integer>();
    }

    public void push(int x) {
        queue.add(x);
        int size = queue.size();
        while (size > 1) {
            queue.add(queue.poll());
            size--;
        }
    }

    public int pop() {
        return queue.poll();
    }

    public int top() {
        return queue.peek();
    }

    public boolean empty() {
        return queue.isEmpty();
    }
}

---

20、有效的括号

public boolean isValid(String s) {
    char[] chars = s.toCharArray();
    Deque<Character> stack = new ArrayDeque<>();
    for (char aChar : chars) {
        if (aChar == '(') {
            stack.push(')');
        } else if (aChar == '{') {
            stack.push('}');
        } else if (aChar == '[') {
            stack.push(']');
        } else if (stack.isEmpty() || stack.peek() != aChar) {
            return false;
        } else {
            stack.pop();
        }
    }
    return stack.isEmpty();
}

---

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

public String removeDuplicates(String s) {
    char[] chars = s.toCharArray();
    Deque<Character> stack = new ArrayDeque<>();
    for (char aChar : chars) {
        if (stack.isEmpty() || aChar != stack.peek()) {
            stack.push(aChar);
        }else {
            stack.pop();
        }
    }
    StringBuilder str = new StringBuilder();
    while (!stack.isEmpty()) {
        str.insert(0, stack.pop());
    }
    return str.toString();
}