如何用JavaScript内置方法实现含子数组的数组扁平化与按GPA排序？

Absolutely! JavaScript has built-in methods that can simplify your code significantly, making it more concise and likely more performant than custom recursion (since native methods are optimized under the hood). Let's tackle this step by step:

1. 扁平化嵌套数组：Array.prototype.flat() #

Instead of writing a custom recursive function, you can use the flat() method. By passing Infinity as an argument, it will flatten all levels of nested arrays automatically, regardless of how deep they are.

For your example array:

const array = [{id: 1, gpa: 3.11}, [{id: 2, gpa: 2.9}, {id: 11, gpa: 3.9}, [{id: 9, gpa: 2.11}]], {id: 7, gpa: 3.31}];

// Flatten to one dimension
const flattened = array.flat(Infinity);
// Result: [{id: 1, gpa: 3.11}, {id: 2, gpa: 2.9}, {id: 11, gpa: 3.9}, {id: 9, gpa: 2.11}, {id: 7, gpa: 3.31}]

Note: If your array might contain non-object/non-array values (though your example doesn't), you can add a filter to keep only the objects:

const flattened = array.flat(Infinity).filter(item => typeof item === 'object' && item !== null);

2. 按gpa降序排序：Array.prototype.sort() #

Your custom comparator works, but you can shorten it with an arrow function for better readability. To sort in descending order (highest gpa first), subtract the first item's gpa from the second:

const sorted = flattened.sort((a, b) => b.gpa - a.gpa);
// Result: [{id: 11, gpa: 3.9}, {id: 7, gpa: 3.31}, {id: 1, gpa: 3.11}, {id: 2, gpa: 2.9}, {id: 9, gpa: 2.11}]

合并成一行代码 #

You can chain these methods together for a clean one-liner:

const result = array.flat(Infinity).sort((a, b) => b.gpa - a.gpa);

Why this is better than custom recursion #

• Readability: Native methods make your code self-documenting—anyone familiar with JS will immediately understand what flat(Infinity) and sort() do.
• Performance: Browser engines optimize native array methods heavily, so they're often faster than hand-written recursion (especially for large arrays).
• Less code: No need to maintain a custom recursive function, which reduces the chance of bugs like infinite loops or missed edge cases.

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