介绍

摆动排序，是队列满足波浪式的顺序。

实现

JavaScript

/*
 * Wiggle sort sorts the array into a wave like array.
 * An array ‘arr[0..n-1]’ is sorted in wave form if arr[0] >= arr[1] <= arr[2] >= arr[3] <= arr[4] >= …..
 */

export const wiggleSort = function (arr) {
  for (let i = 0; i < arr.length; ++i) {
    const shouldNotBeLessThan = i % 2
    const isLessThan = arr[i] < arr[i + 1]
    if (shouldNotBeLessThan && isLessThan) {
      [arr[i], arr[i + 1]] = [arr[i + 1], arr[i]]
    }
  }
  return arr
}

参考

• [LeetCode] 280. Wiggle Sort 摆动排序 (opens new window)
• [LeetCode] Wiggle Sort II 摆动排序之二 (opens new window)