Last updated 3 years ago
vector<int> Solution::wave(vector<int> &A) { sort(A.begin(), A.end()); for(int i = 0; i + 1 < A.size(); i += 2) swap(A[i], A[i + 1]); return A; }
Time Complexity: O(nlogโกn)O(n \log n)O(nlogn)โ
Space Complexity: O(1)O(1)O(1)โ
a1 >= a2 <= a3 >= a4 <= a5.....