class Solution {
public:
void wiggleSort(vector<int>& nums) {
int n = nums.size();
sort(nums.begin(), nums.end());
vector<int> ret = nums;
int l = (n - 1) / 2, r = n - 1;
for (int i = 0; i < n; ++i)
{
if (i % 2 == 0)
{
nums[i] = ret[l--];
}
else
{
nums[i] = ret[r--];
}
}
}
};
leetcode:摆动序列||
最新推荐文章于 2024-07-25 19:34:38 发布