实现数组的扁平化,去重,升序

it2026-03-29  7

实现数组的扁平化,去重,升序

数组扁平化

let arr = [12,3,6,45,8,[1,5,63,8,[23,96,30,21,56,85],75,2,[63,86,45,20,36]]]

使用Array.prototype.flat(Infinity)

let arr = [12,3,6,45,8,[1,5,63,8,[23,96,30,21,56,85],75,2,[63,86,45,20,36]]] let newarr = arr.flat(Infinity) console.log(newarr);//[12, 3, 6, 45, 8, 1, 5, 63, 8, 23, 96, 30, 21, 56, 85, 75, 2, 63, 86, 45, 20, 36]

2.使用Array.prototype.toString将其转换为字符串,然后再将字符串转换为数组

let arr = [12,3,6,45,8,[1,5,63,8,[23,96,30,21,56,85],75,2,[63,86,45,20,36]]] let newarr = arr.toString().split(',')//得到的每一项都是字符串 newarr = newarr.map((item)=>{ return parseInt(item) }) console.log(newarr)

数组去重 1.使用new Set,就可以将其去重,然后在将Set转换为数组

let m = [1,1,1,1,2,2,5,6,9,8] let newarr = new Set(m) newarr = [...newarr]; console.log(newarr)

数组升序

let m = [5,9,63,4,8] let p = m.sort((a,b)=>{return a-b}); consoel.log(p)
最新回复(0)