<span style="font-size:18px;">1.维护一个flag标志进行一次遍历就可以了</span>
int[] sortArray(int[] s){
int n = s.length;
boolean flag = true;
int current = s[0];
for (int i = 0; i < n-1; i++){
if (((flag) &&(current > s[i+1])) || ((!flag) && (current < s[i+1])){
s[i] = s[i+1];
}
else{
s[i] = current;
current = s[i + 1];
}
flag = !flag;
}
s[n-1] = current;
return s;
}
2.利用快排的思想将数组分成两半,然后一边取一个这样取,不确定这个思路是否有问题,欢迎指正??