代码随想录 Day11

---

150、逆波兰表达式求值

public int evalRPN(String[] tokens) {
    Deque<Integer> stack = new ArrayDeque<>();
    for (String token : tokens) {
        switch (token) {
            case "+" -> stack.push(stack.pop() + stack.pop());
            case "-" -> stack.push(-stack.pop() + stack.pop());
            case "*" -> stack.push(stack.pop() * stack.pop());
            case "/" -> {
                int temp01 = stack.pop();
                int temp02 = stack.pop();
                stack.push(temp02 / temp01);
            }
            default -> stack.push(Integer.parseInt(token));
        }
    }
    return stack.pop();
}

---

239、滑动窗口最大值

public int[] maxSlidingWindow(int[] nums, int k) {
    if (nums.length == 0 || k == 0) {
        return new int[0];
    }
    Deque<Integer> deque = new LinkedList<>();
    int[] res = new int[nums.length - k + 1];
    for (int j = 0, i = 1 - k; j < nums.length; i++, j++) {
        if (i > 0 && deque.peekFirst() == nums[i - 1]) {
            deque.removeFirst();
        }
        while (!deque.isEmpty() && deque.peekLast() < nums[j]) {
            deque.removeLast();
        }
        deque.addLast(nums[j]);
        if (i >= 0) {
            res[i] = deque.peekFirst();
        }
    }
    return res;
}

debug大概理解想法和思路了，希望后面能自己写出来～

---

347、前 K 个高频元素

public int[] topKFrequent(int[] nums, int k) {
    Map<Integer, Integer> map = new HashMap<>();
    for (int num : nums) {
        map.put(num, map.getOrDefault(num, 0) + 1);
    }
    Queue<int[]> queue = new PriorityQueue<>((oldPair, newPair) -> newPair[1] - oldPair[1]);
    for (Map.Entry<Integer, Integer> entry : map.entrySet()) {
        queue.add(new int[]{entry.getKey(), entry.getValue()});
    }
    int[] res = new int[k];
    for (int i = 0; i < k; i++) {
        res[i] = queue.poll()[0];
    }
    return res;
}