js implements the problem of deduplication of two arrays (one array is contained in another array)

var arr1 = [
        {id:1,name:'a'},
        {id:2,name:'abc'},
        {id:3,name:'abbb'},
        {id:4,name:'abxxx'},
        {id:5,name:'xyz'},
        {id:6,name:'abcdef'},
        {id:7,name:'abzzzz'}];
    var arr2 = [
        {id:1,name:'a'},
        {id:5,name:'xyz'},
        {id:7,name:'abzzzz'}];

 

var out=[];
var flag = true;
for(var i=0;i<arr1.length;i++){
    flag=true;
    for(var j=0;j<arr2.length;j++){
        if(arr1[i].id==arr2[j].id && arr[i].name == arr2[j].name ){ // If the data can guarantee that id and name are always paired, one less comparison can be made condition
            flag = false;
            break;
        }
    }
    if(flag){
        out.push(arr1[i]);
    }
}

 

Reprint address: https://segmentfault.com/q/1010000008592244