반응형
#include <cmath>
#include <algorithm>
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
for(int i=0; i<A.size(); i++){
A[i]=abs(A[i]);
}
sort(A.begin(), A.end());
unique(A.begin(), A.end());
for(int i=1; i<A.size(); i++){
if(A[i-1]>=A[i]) return i;
}
return A.size();
}
반응형
'코테' 카테고리의 다른 글
[Codility] Triangle C++ (0) | 2022.01.07 |
---|---|
[Codility] MaxProductOfThree C++ (0) | 2022.01.07 |
[Codility] ChocolatesByNumbers C++ (0) | 2022.01.04 |
[Codility] CountFactors C++ (0) | 2022.01.03 |
[Codility] MaxNonoverlappingSegments C++ (0) | 2021.12.31 |