class Solution {
public int minDeletions(int[] nums) {
int n=nums.length;
int count_delete=0;
int i=0;
int j=1;
while(i<n && j<n){
while(j<n && nums[i]==nums[j]){
count_delete++;
j++;
}
j++;
while(i<j){
i++;
}
i--;
}
return count_delete;
}
}
Y2xhc3MgU29sdXRpb24gewogICAgcHVibGljIGludCBtaW5EZWxldGlvbnMoaW50W10gbnVtcykgewogICAgICAgIGludCBuPW51bXMubGVuZ3RoOwoKICAgICAgICBpbnQgY291bnRfZGVsZXRlPTA7CiAgICAgICAgaW50IGk9MDsKICAgICAgICBpbnQgaj0xOwogICAgICAgIHdoaWxlKGk8biAmJiBqPG4pewogICAgICAgICAgICB3aGlsZShqPG4gJiYgbnVtc1tpXT09bnVtc1tqXSl7CiAgICAgICAgICAgICAgICBjb3VudF9kZWxldGUrKzsKICAgICAgICAgICAgICAgIGorKzsKICAgICAgICAgICAgfQogICAgICAgICAgICBqKys7CiAgICAgICAgICAgIHdoaWxlKGk8ail7CiAgICAgICAgICAgICAgICBpKys7CiAgICAgICAgICAgIH0KICAgICAgICAgICAgaS0tOwogICAgICAgIH0KICAgICAgICByZXR1cm4gY291bnRfZGVsZXRlOwogICAgfQp9