面試官會(huì)問(wèn)到的數(shù)組操作
點(diǎn)擊上方 前端瓶子君，關(guān)注公眾號(hào)
回復(fù)算法，加入前端編程面試算法每日一題群
數(shù)組去重
數(shù)組去重的測(cè)試數(shù)據(jù)如下：
const sourceArray = [
null, 6, 34, '6', [], 'a', undefined, 'f', 'a', [],
34, null, {}, true, NaN, {}, NaN, false, true, undefined
]
const filterArray = unique(sourceArray)
雙循環(huán)
function unique(sourceData) {
let flag
let filterArray = []
for (let i = 0; i < sourceData.length; i++) {
flag = true
for (let j = 0; j < filterArray.length; j++) {
if (sourceData[i] === filterArray[j]) {
flag = false
break
}
}
if (flag) {
filterArray.push(sourceData[i])
}
}
return filterArray
}
// [null, 6, 34, "6", [], "a", undefined, "f", [], {}, true, NaN, {}, NaN, false]
function unique(sourceData) {
let flag
let filterArray = []
for (let i = 0; i < sourceData.length; i++) {
flag = true
for (let j = i + 1; j < sourceData.length; j++) {
if (sourceData[i] === sourceData[j]) {
flag = false
break
}
}
if (flag) {
filterArray.push(sourceData[i])
}
}
return filterArray
}
// [6, "6", [], "f", "a", [], 34, null, {}, NaN, {}, NaN, false, true, undefined]
indexOf
function unique(sourceData) {
return sourceData.filter((item, index) => {
return sourceData.indexOf(item) === index
})
}
// [null, 6, 34, "6", [], "a", undefined, "f", [], {}, true, {}, false]
注：用sourceData.indexOf(NaN)返回的永遠(yuǎn)是-1，而index永遠(yuǎn)不可能為-1，所以NaN過(guò)濾掉了
function unique(sourceData) {
let filterArray = []
sourceData.forEach(item => {
// filterArray數(shù)組中沒(méi)有item
if (filterArray.indexOf(item) === -1) {
filterArray.push(item)
}
})
return filterArray
}
// [null, 6, 34, "6", [], "a", undefined, "f", [], {}, true, NaN, {}, NaN, false]
sort
function unique(sourceData) {
let filterArray = []
sourceData.sort()
for (let i = 0; i < sourceData.length; i++) {
if (sourceData[i] !== filterArray[filterArray.length - 1]) {
filterArray.push(sourceData[i])
}
}
return filterArray
}
// [[], [], 34, 6, "6", NaN, NaN, {}, {}, "a", "f", false, null, true, undefined]
注：以上幾個(gè)方案都不適用于含有NaN、數(shù)組、對(duì)象等引用數(shù)據(jù)類(lèi)型的情況。
includes
function unique(sourceData) {
let filterArray = []
sourceData.forEach(item => {
if (!filterArray.includes(item)) {
filterArray.push(item)
}
})
return filterArray
}
// [[], [], 34, 6, "6", NaN, {}, {}, "a", "f", false, null, true, undefined]
reduce
function unique(sourceData = []) {
return sourceData.reduce((pre, cur) => pre.includes(cur) ? pre : [...pre, cur], [])
}
// [[], [], 34, 6, "6", NaN, {}, {}, "a", "f", false, null, true, undefined]
map
function unique(sourceData) {
let map = new Map() // 創(chuàng)建Map實(shí)例
return sourceData.filter(item => {
return !map.has(item) && map.set(item, 1)
})
}
// [[], [], 34, 6, "6", NaN, {}, {}, "a", "f", false, null, true, undefined]
set
function unique10(sourceData) {
return [...new Set(sourceData)]
}
// [[], [], 34, 6, "6", NaN, {}, {}, "a", "f", false, null, true, undefined]
注：以上幾個(gè)方案不適用于含有數(shù)組、對(duì)象等引用數(shù)據(jù)類(lèi)型的情況。
object
利用對(duì)象屬性的唯一性去重。
function unique(sourceData) {
let map = new Map() // 創(chuàng)建Map實(shí)例
let filterArray = []
for (let i = 0; i < sourceData.length; i++) {
/**
* 為什么要使用JSON.stringify()
* typeof sourceData[i] + sourceData[i] 拼接字符串時(shí)可能存在[object Object]
*/
if (!map[typeof sourceData[i] + JSON.stringify(sourceData[i])]) {
map[typeof sourceData[i] + JSON.stringify(sourceData[i])] = true;
filterArray.push(sourceData[i]);
}
}
return filterArray
}
// [[], 34, 6, "6", NaN, {}, "a", "f", false, null, true, undefined]
隨機(jī)生成了10000組數(shù)字類(lèi)型的數(shù)據(jù)，按上面代碼編寫(xiě)的順序執(zhí)行時(shí)間如下：
總結(jié)一下：耗時(shí)較短的是 set map sort 幾個(gè)方案，耗時(shí)較長(zhǎng)的是 reduce 方案，能處理引用數(shù)據(jù)類(lèi)型的只有 object 方案。
數(shù)組扁平化
數(shù)組扁平化的測(cè)試數(shù)據(jù)如下：
const sourceArray = [4, '4', ['c', 6], {}, [7, ['v']], ['s', [6, 23, ['嘆郁孤']]]]
concat + 遞歸
function flat(sourceArray, flatArray) {
sourceArray.forEach(item => {
Array.isArray(item) ? flatArray.concat(flat(item, flatArray)) : flatArray.push(item)
});
return flatArray
}
const flatArray = flat(sourceArray, [])
// [4, "4", "c", 6, {…}, 7, "v", "s", 6, 23, "嘆郁孤"]
... + 遞歸
function flat(sourceArray) {
while (sourceArray.some(item => Array.isArray(item))) {
sourceArray = [].concat(...sourceArray);
}
return sourceArray;
}
const flatArray = flat(sourceArray)
// [4, "4", "c", 6, {…}, 7, "v", "s", 6, 23, "嘆郁孤"]
reduce + 遞歸
function flat(sourceArray) {
return sourceArray.reduce((pre, cur) => pre.concat(Array.isArray(cur) ? flat3(cur) : cur), [])
}
const flatArray = flat(sourceArray)
// [4, "4", "c", 6, {…}, 7, "v", "s", 6, 23, "嘆郁孤"]
flat
function flat(sourceArray) {
/**
* flat參數(shù)說(shuō)明
* 默認(rèn)：flag() 數(shù)組只展開(kāi)一層
* 數(shù)字：flat(2) 數(shù)組展開(kāi)兩層，傳入控制展開(kāi)層數(shù)的數(shù)字；數(shù)字小于等于0，返回原數(shù)組
* Infinity：flat(Infinity)，展開(kāi)成一維數(shù)組
*/
return sourceArray.flat(Infinity)
}
const flatArray = flat(sourceArray)
// [4, "4", "c", 6, {…}, 7, "v", "s", 6, 23, "嘆郁孤"]
數(shù)組并集
數(shù)組并集、交集、差集的測(cè)試數(shù)據(jù)如下：
const sourceArray = [
48, 34, '6', undefined, 'f', 'a',
34, true, NaN, false, 34, true, 'f'
]
const sourceArray2 = [
52, 34, '6', undefined, 's', 23,
'cf', true, NaN, false, NaN
]
filter + includes
function union(sourceArray, sourceArray2) {
const unionArray = sourceArray.concat(sourceArray2.filter(item => !sourceArray.includes(item)))
return [...new Set(unionArray)]
}
const unionArray = union(sourceArray, sourceArray2)
// [48, 34, "6", undefined, "f", "a", true, NaN, false, 52, "s", 23, "cf"]
set
function union(sourceArray, sourceArray2) {
return [...new Set([...sourceArray, ...sourceArray2])]
}
const unionArray = union(sourceArray, sourceArray2)
// [48, 34, "6", undefined, "f", "a", true, NaN, false, 52, "s", 23, "cf"]
數(shù)組交集
filter + includes
function intersect(sourceArray, sourceArray2) {
const intersectArray = sourceArray.filter(item => sourceArray2.includes(item))
return [...new Set(intersectArray)]
}
const intersectArray = intersect(sourceArray, sourceArray2)
// [34, "6", undefined, true, NaN, false]
set
function intersect(sourceArray, sourceArray2) {
sourceArray = new Set(sourceArray)
sourceArray2 = new Set(sourceArray2)
const intersectArray = [...sourceArray].filter(item => sourceArray2.has(item))
return [...new Set(intersectArray)]
}
const intersectArray = intersect(sourceArray, sourceArray2)
// [34, "6", undefined, true, NaN, false]
數(shù)組差集
filter + includes
function difference(sourceArray, sourceArray2) {
const differenceArray = sourceArray.concat(sourceArray2)
.filter(item => !sourceArray2.includes(item))
return [...new Set(differenceArray)]
}
const differenceArray = difference(sourceArray, sourceArray2)
// [48, "f", "a"]
set
function difference(sourceArray, sourceArray2) {
sourceArray = new Set(sourceArray)
sourceArray2 = new Set(sourceArray2)
const intersectArray = [...sourceArray].filter(item => !sourceArray2.has(item))
return [...new Set(intersectArray)]
}
const differenceArray = difference(sourceArray, sourceArray2)
// [48, "f", "a"]
數(shù)組分割
數(shù)組分割測(cè)試數(shù)據(jù)如下：
const sourceArray = [73, 343, 'g', 56, 'j', 10, 32, 43, 90, 'z', 9, 4, 28, 'z', 58, 78, 'h']
const chunkArray = chunk(sourceArray, 4)
while + slice
function chunk(sourceArray = [], length = 1) {
let chunkArray = []
let index = 0
while (index < sourceArray.length) {
chunkArray.push(sourceArray.slice(index, index += length))
}
return chunkArray
}
const chunkArray = chunk(sourceArray, 4)
// [[73, 343, "g", 56], ["j", 10, 32, 43], [90, "z", 9, 4], [28, "z", 58, 78], ["h"]]
reduce
以下是出自 25個(gè)你不得不知道的數(shù)組reduce高級(jí)用法 這篇文章的數(shù)組分割方法，乍眼一看可能不太好理解，我稍微改了下代碼結(jié)并加了注釋便于理解。原始代碼如下：
function chunk(arr = [], size = 1) {
return arr.length ? arr.reduce((t, v) => (t[t.length - 1].length === size ? t.push([v]) : t[t.length - 1].push(v), t), [[]]) : [];
}
調(diào)整后的代碼：
function chunk(arr = [], size = 1) {
if (arr.length) {
arr = arr.reduce((t, v) => {
/**
* t的初始值為[[]]，這時(shí)t.length為1，所以t[t.length - 1]為[]，t[t.length - 1].length為0，將v push到t[0]中，此時(shí)t = [[73]]
* 這時(shí)t.length還是為1，所以t[t.length - 1]為[73]，t[t.length - 1].length為1，將v push到t[0]中，此時(shí)t = [[73, 343]]
* 直到t[0]有四個(gè)數(shù)據(jù)后[[73, 343, "g", 56]]
* 這時(shí)t.length為1，所以t[t.length - 1]為[73, 343, "g", 56]，t[t.length - 1].length為4，將[v] push到t中，此時(shí)t = [[73, 343, "g", 56]['j']]，以此類(lèi)推
*/
t[t.length - 1].length === size ? t.push([v]) : t[t.length - 1].push(v)
return t
}, [[]])
}
return arr
}
// [[73, 343, "g", 56], ["j", 10, 32, 43], [90, "z", 9, 4], [28, "z", 58, 78], ["h"]]
數(shù)組轉(zhuǎn)對(duì)象
Object.assign
const sourceArray = ['CSS世界', '活著', '資本論']
function toObject(sourceArray) {
return Object.assign({}, sourceArray)
}
const result = toObject(sourceArray)
// {0: "CSS世界", 1: "活著", 2: "資本論"}
reduce
第一種對(duì)象形式
const books = [
{ name: "CSS世界", author: "張?chǎng)涡?, price: 69, serialNumber: 'ISBN: 97871151759' },
{ name: "活著", author: "余華", price: 17.5, serialNumber: 'I247.57/105' },
{ name: "資本論", author: "馬克思", price: 75, serialNumber: '9787010041155' }
];
function toObject(books) {
return books.reduce((pre, cur) => {
/**
* ...rest用于獲取剩余的解構(gòu)數(shù)據(jù)
* 如：{ name: "CSS世界", author: "張?chǎng)涡?, price: 69 }
*/
const { serialNumber, ...rest } = cur;
pre[serialNumber] = rest;
return pre;
}, {});
}
const map = toObject(books)
/**
* {
* ISBN: 97871151759: {name: "CSS世界", author: "張?chǎng)涡?, price: 69},
* I247.57/105: {name: "活著", author: "余華", price: 17.5},
* 9787010041155: {name: "資本論", author: "馬克思", price: 75}
* }
*/
第二種對(duì)象形式
// 方案一
const person = [
{ name: "Siri", age: 22 },
{ name: "Bob", age: 20 },
{ name: "Tom", age: 21 }
];
function toObject(person) {
return person.reduce((pre, cur) => (pre[cur.name] = cur.age, pre), {})
}
const result = toObject(person)
// {Siri: 22, Bob: 20, Tom: 21}
// 方案二
function toObject2(person) {
return person.reduce((pre, cur) => ({...pre, [cur.name]: cur.age}), {})
}
const result = toObject2(person)
// {Siri: 22, Bob: 20, Tom: 21}
參考文章
-
解鎖多種JavaScript數(shù)組去重姿勢(shì) -
25個(gè)你不得不知道的數(shù)組reduce高級(jí)用法
關(guān)于本文
來(lái)源：廢廢
https://segmentfault.com/a/1190000040273511
最后
評(píng)論
圖片
表情