數(shù)組去重
對(duì)象數(shù)組去重分為兩類：根據(jù)某一屬性去重，和去重完全相同對(duì)象（屬性屬性值都相同）
一.數(shù)組嵌套對(duì)象，根據(jù)對(duì)象某一屬性去重
let arr = [
{id:1, setting:'demo', jointCategoryName:'success'},
{id:2, setting:'dev', jointCategoryName:'success'},
{id:3, setting:'prod', jointCategoryName:'fail'},
{id:4, setting:'demo', jointCategoryName:'waiting'},
{id:3, setting:'prod', jointCategoryName:'fail'},
{id:2, setting:'test', jointCategoryName:'success'}
]
function unipFunc(arr){
let arr1 = []; //存id
let newArr = []; //存新數(shù)組
for(let i in arr){
if(arr1.indexOf(arr[i].id) == -1){
arr1.push(arr[i].id);
newArr.push(arr[i]);
}
}
return newArr;
}
二、數(shù)組嵌套對(duì)象，去重完全相同對(duì)象（屬性屬性值都相同）
整理如下：
首先、循環(huán)數(shù)組，拿到對(duì)象的所有屬性組成的數(shù)組；
其次、循環(huán)屬性數(shù)組把對(duì)象的屬性和對(duì)應(yīng)的值拼接成字符串；
然后、利用 hasOwnProperty 方法判斷這個(gè)字符串是不是對(duì)象 obj 里的屬性，如果不是則以這個(gè)字符串為屬性，true為值給 obj 對(duì)象新增一個(gè)屬性；
let arr = [
{id:1, setting:'demo', jointCategoryName:'success'},
{id:2, setting:'dev', jointCategoryName:'success'},
{id:3, setting:'prod', jointCategoryName:'fail'},
{id:4, setting:'demo', jointCategoryName:'waiting'},
{id:3, setting:'prod', jointCategoryName:'fail'},
{id:2, setting:'test', jointCategoryName:'success'}
]
function unipFunc(arr){
var newArr= []; //存新數(shù)組
var obj= {}; //存處理后轉(zhuǎn)成字符串的對(duì)象
for (var i = 0; i < arr.length; i++) {
var keys = Object.keys(arr[i]);
//keys.sort(function(a, b) {
// return (Number(a) - Number(b));
//});
var str = '';
for (var j = 0; j < keys.length; j++) {
str += JSON.stringify(keys[j]);
str += JSON.stringify(arr[i][keys[j]]);
}
if (!obj.hasOwnProperty(str)) {
newArr.push(arr[i]);
obj[str] = true;
}
}
return newArr;
}
三、普通數(shù)組去重
function unipFunc(arr) {
let newArr = [];
for (var i = 0; i < arr.length; i++) {
if (newArr.indexOf(arr[i]) === -1) {
newArr.push(arr[i]);
}
}
return newArr;
}
四、普通數(shù)組獲取重復(fù)元素
方法一：indexOf和lastIndexOf
function unipFunc(arr) {
let newArr = [];
arr.forEach((item)=>{
if(arr.indexOf(item) !== arr.lastIndexOf(item) && newArr.indexOf(item) === -1){
newArr.push(item);
}
});
return newArr;
}
方法二：雙層for循環(huán)
function unipFunc(arr) {
var Arr = [];
for(let i=0; i<arr.length; i++ ){
for(let j=i+1; j<arr.length; j++){
if(arr[i]===arr[j] && Arr.indexOf(arr[j])===-1){
Arr.push(arr[i]);
}
}
}
return Arr;
}
五、數(shù)組嵌套對(duì)象，獲取重復(fù)元素和唯一元素及坐標(biāo)
//數(shù)據(jù)
const arr =[
{id:1, schoolId:'100', jointCategoryName:'美術(shù)'},
{id:2, schoolId:'200', jointCategoryName:'美術(shù)'},
{id:3, schoolId:'300', jointCategoryName:'設(shè)計(jì)'},
{id:4, schoolId:'100', jointCategoryName:'音樂(lè)'},
{id:3, schoolId:'300', jointCategoryName:'設(shè)計(jì)'},
{id:2, schoolId:'400', jointCategoryName:'美術(shù)'}
]
let key = {} //存儲(chǔ)的 key 是type的值，value是在indeces中對(duì)應(yīng)數(shù)組的下標(biāo)
let indices = [] //數(shù)組中每一個(gè)值是一個(gè)數(shù)組，數(shù)組中的每一個(gè)元素是原數(shù)組中相同type的下標(biāo)
arr.map((item, index) => {
//根據(jù)對(duì)應(yīng)字段 分類（type）
let type= item.type
let _index = key[type]
if (_index !== undefined) {
indices[_index].push(index)
} else {
key[type] = indices.length
indices.push([index])
}
})
// 歸類結(jié)果
let result = []
indices.map((item) => {
item.map((index) => {
//result.push(List[index]) 相同項(xiàng)排序在一起
//if (item.length > 1) {} 只要重復(fù)項(xiàng)
//if (item.length == 1){} 只要單獨(dú)項(xiàng)
//我這里需要重復(fù)項(xiàng) 根據(jù)業(yè)務(wù)處理
if (item.length > 1) {
result.push(arr[index])
}
})
})
console.log('獲取重復(fù)的值=====================>',result[0].type)
return result;
六、Map()
let arrObj = [
{id:1, schoolId:'100', jointCategoryName:'美術(shù)'},
{id:2, schoolId:'200', jointCategoryName:'美術(shù)'},
{id:3, schoolId:'300', jointCategoryName:'設(shè)計(jì)'},
{id:4, schoolId:'100', jointCategoryName:'音樂(lè)'},
{id:3, schoolId:'300', jointCategoryName:'設(shè)計(jì)'},
{id:2, schoolId:'400', jointCategoryName:'美術(shù)'}
];
// 方法一：
let map = new Map();
for (let item of arrObj) {
if (!map.has(item.id)) {
map.set(item.id, item);
};
};
arr = [...map.values()];
console.log(arr);
// 方法二： (代碼較為簡(jiǎn)潔)
const map = new Map();
const newArr = arrObj.filter(v => !map.has(v.id) && map.set(v.id, 1));
console.log(newArr);
七、數(shù)組去重
普通數(shù)組去重
let arr = [1, 1, 1, 2, 3, 4, 5, 5, 6];
let crr = [];
const res = arr.reduce((brr, va) => {
if (!brr.includes(va)) {
brr.push(va);
} else {
crr.push(va);
}
return brr;
}, []);
console.log(res);
console.log(crr);
數(shù)組對(duì)象去重
方法一
let arr = [{label:'你好',prop:'aa'},{label:'你好',prop:'aa'},{label:'你好2',prop:'bb1'},{label:'你好2',prop:'bb2'}]
let deWeightArr = []; // 去重后的數(shù)組
let repetitionArr = []; // 重復(fù)的數(shù)組
arr.forEach((item1) => {
const check = deWeightArr.every((item2) => {
return item1.prop !== item2.prop;
});
check ? deWeightArr.push(item1) : repetitionArr.push(item1);
});
console.log('重復(fù)的數(shù)據(jù)================>>>>>',repetitionArr)
console.log('獲取數(shù)組去重后的數(shù)據(jù)================>>>>>',deWeightArr)
方法二文章來(lái)源：http://www.zghlxwxcb.cn/news/detail-812201.html
this.repeatData = [];
dataList.forEach((item) => {
if (
this.repeatData.filter((material) => material.archiveRank === item.archiveRank)
.length === 0
) {
this.repeatData.push(item);
}
});
console.log('獲取重復(fù)的數(shù)組數(shù)據(jù)=====》<<<<<<<<<<<<<<<<<<<<<<<',this.repeatData)
原生去重文章來(lái)源地址http://www.zghlxwxcb.cn/news/detail-812201.html
let arr =
[
{id:1, schoolId:'100', jointCategoryName:'美術(shù)'},
{id:2, schoolId:'200', jointCategoryName:'美術(shù)'},
{id:3, schoolId:'300', jointCategoryName:'設(shè)計(jì)'},
{id:4, schoolId:'100', jointCategoryName:'音樂(lè)'},
{id:3, schoolId:'300', jointCategoryName:'設(shè)計(jì)'},
{id:2, schoolId:'400', jointCategoryName:'美術(shù)'}
];
export const distinct = (arr) => {
var result = [];
var obj = {};
for (var i = 0; i < arr.length; i++) {
if (!obj[arr[i].jointCategoryName]) {
result.push(arr[i]);
obj[arr[i].jointCategoryName] = true;
}
}
console.log('獲取重復(fù)的數(shù)組數(shù)據(jù)=====》<<<<<<<<<<<<<<<<<<<<<<<',result)
return result;
};
distinct(arr)
到了這里，關(guān)于Js：獲取數(shù)組對(duì)象重復(fù)屬性值和數(shù)組對(duì)象去重的文章就介紹完了。如果您還想了解更多內(nèi)容，請(qǐng)?jiān)谟疑辖撬阉鱐OY模板網(wǎng)以前的文章或繼續(xù)瀏覽下面的相關(guān)文章，希望大家以后多多支持TOY模板網(wǎng)！
