2216. 美化数组的最少删除数

2216. 美化数组的最少删除数

• 难度: medium
• 原始链接: https://leetcode.cn/problems/minimum-deletions-to-make-array-beautiful
• 标签: 模拟

解法一: 模拟

go

func minDeletion(nums []int) int {
    count := 1
    pre := nums[0]
    for _, num := range nums[1:] {
        if pre != num || pre == num && (count & 1) == 0 {
            count++
            pre = num
        }
    }
    if (count & 1) != 0 {
        return len(nums) - count + 1
    }
    return len(nums) - count
}