Minimum Deletions to Make Array Beautiful LeetCode solution in C++

1
class Solution {
2
public:
3
int minDeletion(vector<int> &nums) {
4
bool even = true;
5
int size = 0, c = 0;
6
for (int i = 0; i < nums.size(); i++) {
7
while (i + 1 < nums.size() && even && nums[i] == nums[i + 1]) i++, c++;
8
size++;
9
even = !even;
10
}
11
return c + size % 2;
12
}
13
};

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0