如何更简洁实现将指定元素排至末尾的字符串数组自定义排序？

Great question! Your current approach gets the job done, but there are cleaner and more efficient ways to achieve the same result without needing separate _.pull and splice steps. Let's break down two solid alternatives:

1. Custom Sort Comparator (In-Place, Single Pass) #

Instead of sorting first and then rearranging, you can handle the "all" placement directly in the sort function's comparator. This combines sorting and positioning into one single traversal of the array:

const arr = ["bad", "good", "all", "ugly"];
arr.sort((a, b) => {
  // Push "all" to the end when comparing it with any other element
  if (a === "all") return 1;
  // Keep other elements before "all"
  if (b === "all") return -1;
  // Use default lexicographical sort for all other elements
  return a.localeCompare(b);
});

// Result: ["bad", "good", "ugly", "all"]

Why this works better: #

• Single operation: No extra array mutations after sorting—everything happens in one step.
• More efficient: sort runs in O(n log n) time, and the comparator adds negligible overhead. You avoid the extra O(n) operations from _.pull and splice.
• Handles duplicates: If your array had multiple "all" entries, they’d all be grouped neatly at the end automatically.

2. Filter + Sort + Push (Non-Destructive) #

If you want to leave the original array untouched, split the logic into filtering out "all", sorting the remaining elements, then appending "all" back:

const arr = ["bad", "good", "all", "ugly"];
const sortedArr = arr.filter(item => item !== "all").sort();
sortedArr.push("all");

// Result: ["bad", "good", "ugly", "all"]

Why this is a strong choice: #

• Clear and readable: The logic is straightforward—separate the special element, sort the rest, then add it back.
• Non-destructive: The original array stays intact, which is useful if you need it for other tasks later.
• Scales to multiple "all"s: If you have multiple instances of "all", just replace push("all") with sortedArr.push(...arr.filter(item => item === "all")) to keep all of them at the end.

Quick Comparison to Your Original Approach #

Your current method uses three distinct steps:

1. Sort the array (O(n log n))
2. _.pull(arr, "all") (O(n) to find and remove the element)
3. splice(3, 0, "all") (O(n) to shift elements and insert)

Both alternatives above cut down on unnecessary operations and avoid costly array shifts, making them more efficient and concise overall.

内容的提问来源于stack exchange，提问作者anubysh