【栈】美化数组的最少删除数

题目：

/**栈
 * 思路：将下标为偶数的直接加入栈中，下标为奇数并且和左边偶数不相等直接入栈
 * @auther start
 * @create 2023-11-23 19:44
 */
public class L2216 {
    public int minDeletion(int[] nums) {
        int n = nums.length;
        if (n == 0) return 0;
        Deque<Integer> stack = new LinkedList<>();
        stack.push(nums[0]);
        for (int i = 1; i < n; i++) {
            if (stack.size() % 2 == 0) {
                stack.push(nums[i]);
            } else {
                int val = stack.peek();
                if (val == nums[i]) continue;
                stack.push(nums[i]);
            }
        }
        if (stack.size() % 2 == 0) return n - stack.size();
        return n - stack.size() + 1;
    }
}