My Solution
\nint minDeletion(vector<int>& nums) {\n        int ans=0;\n        for(int i=0;i<nums.size()-1;i++){\n            if(nums[i] == nums[i+1]){\n                an
```\nint minDeletion(vector<int>& nums) {\n        int ans=0;\n        for(int i=0;i<nums.size()-1;i++){\n            if(nums[i] == nums[i+1]){\n                ans++;\n            }else{\n                i++;\n            }\n        }\n        if((nums.size()-ans) % 2 != 0){\n            ans++;\n        }\n        return ans;\n    }\n```
['Greedy', 'C', 'Python', 'C++', 'Java', 'Python3']