【每日一题】- 2019-08-22 - 奇偶排序 about fe-interview HOT 2 CLOSED

function OESort(nums) {
	var len = nums.length;
	nums.sort((i, i2) => i - i2);
	for(var i = 0; i < len - 1; i+=2) {
		var tmp = nums[i];
		nums[i] = nums[i + 1];
		nums[i + 1] = tmp; 
	}
	return nums
}

function OESort(list) {
    const res = [];
    let cnt = 0;

    list.sort((a, b) => a - b);

    for(let i = 1; i < list.length; i += 2) {
        cnt++;
        res[i] = list[(i / 2) >>> 0];
    }
    for(let i = 0; i < list.length; i += 2) {
        res[i] = list[cnt + (i / 2) >>> 0];
    }

    return res;
}

function OESort(list) {
    function swap(l, i, j) {
      const t = l[i];
      l[i] = l[j];
      l[j] = t;
    }
    for (let i = 0; i < list.length; i += 2) {
      if (list[i] < list[i + 1]) {
        swap(list, i, i + 1);
      }
      if (i > 1 && list[i] < list[i - 1]) {
        swap(list, i, i - 1);
      }
    }

    return list;
  }