Untitled
unknown
c_cpp
a year ago
654 B
6
Indexable
vector<int> solution(vector<int> &A){ int n = A.size() ; vector<int> answer ; int count = 1 ; for(int i=1; i<A.size(); i++){ if(A[i] != A[i-1]){ answer.push_back(A[i-1]) ; count = 1 ; } else{ if(count % 2 == 1){ answer.push_back(A[i-1]) ; } else{ answer.push_back(A[i-1]-1) ; } count++ ; } } if(count % 2 == 1){ answer.push_back(A[n-1]); } else{ answer.push_back(A[n-1]-1); } return answer ; }
Editor is loading...
Leave a Comment