class Solution {
public:
int minDeletion(vector<int>& nums) {
int n = nums.size();
int cnt = 0;
for (int i = 0; i < n; i ++ )
if ((i - cnt) % 2 == 0 && i + 1 < n && nums[i] == nums[i + 1])
cnt ++ ;
if ((n - cnt) % 2) return cnt + 1;
return cnt;
}
};