leetcode-Wiggle Sort II-324

class Solution {
public:
void wiggleSort(vector<int>& nums) {
sort(nums.begin(), nums.end());
int mid=(nums.size()+1)/2;
int s=mid-1;
vector<int> tmp;
vector<int>::iterator it=tmp.begin();
int e=nums.size()-1;
while(e>=mid){
it=tmp.insert(it,nums[s--]);   //我有病，这个直接用push_back
it=tmp.insert(it,nums[e--]);
}
if(nums.size()%2) tmp.insert(it,nums[s]);
reverse(tmp.begin(), tmp.end());
nums=tmp;
}
};