javascript 如何對兩個數(shù)組進行比較
問題描述
數(shù)組a
[{key:1,name:’name1’},{key:2,name:’name2’},{key:3,name:’name3’},{key:4,name:’name4’},{key:5,name:’name5’}]
數(shù)組b是在數(shù)組a的一部分
[{key:1,name:’name1’},{key:2,name:’name2’}]
數(shù)組c是在數(shù)組b的基礎(chǔ)上進行修改
[{key:1,name:’name11’},{key:22,name:’name22’}]
現(xiàn)在需要最后的結(jié)果為key:1被修改,key:2被刪除,key:3,key:4,key:5無變化保留,key:22被添加
[{key:1,name:’name11’},{key:3,name:’name3’},{key:4,name:’name4’},{key:5,name:’name5’},{key:22,name:’name22’}]
請問一下如何才能實現(xiàn)這個邏輯
問題解答
回答1:你是要比較還是合并?合并用 deepmerge 很方便
回答2://引入Lodash_.extend(_.difference(a, b), c)回答3:
var a = [{key:1,name:’name1’},{key:2,name:’name2’},{key:3,name:’name3’},{key:4,name:’name4’},{key:5,name:’name5’}];var b = [{key:1,name:’name1’},{key:2,name:’name2’}];var c = [{key:1,name:’name11’},{key:22,name:’name22’}];var d = [];d = $.extend(a,(b,c));console.log(d);
extend方法 跟git 的merge差不多我那樣寫應(yīng)該會得到你最后想要的那種結(jié)果
回答4:function compare(val1,val2){ if(val1 < val2){return 1; }else if(val1 > val2){return -1; }else{return 0; }}var values = [1,2,50,60,10,20,80];values.sort(compare);alert(values); //80,60,50,20,10,2,1回答5:
如果找不到好的工具,或者不想污染命名空間,那就把數(shù)組解耦,這樣應(yīng)該可以滿足你的要求
let a = [{ key: 1, name: ’name1’ }, { key: 3, name: ’name3’ }, { key: 2, name: ’name2’ }, { key: 4, name: ’name4’ }, { key: 5, name: ’name5’ }];let b = [{ key: 1, name: ’name1’ }, { key: 2, name: ’name2’ }];let c = [{ key: 22, name: ’name22’ }, { key: 1, name: ’name11’ }];let akeys = a.map(x => x.key);let aname = a.map(x => x.name)let bkeys = b.map(x => x.key)//1,2let bname = b.map(x => x.name)let ckeys = c.map(x => x.key)//1,22let cname = c.map(x => x.name)ckeys.forEach(function (key, index) { if (bkeys.includes(key)) a[akeys.indexOf(key)].name = cname[ckeys.indexOf(key)] else { a[akeys.indexOf(bkeys[1])].key = key a[akeys.indexOf(bkeys[1])].name = cname[ckeys.indexOf(key)] }})console.log(a)回答6:
給你一段代碼拿去想象(只適用與數(shù)組合并),將下面的代碼拿到控制臺輸出一下就行了
function arrayExtends(){ var arrs = Array.prototype.slice.call(arguments); if(arrs.length < 2){return arrs[0]; } var save = arrs.pop(),now; while(now = arrs.pop()){for( var i = 0 , len = save.length; i < len; i++ ){ now[i] = save[i];}save = now; } return save;}arrayExtends([1,2,3,6,7],[4,5,{hello:'world'}],[{key:1,name:'zz'}]);
然后修改下適應(yīng)你的需求:
function arrayExtends(){ var arrs = Array.prototype.slice.call(arguments); if(arrs.length < 2){return arrs[0]; } var save = arrs.pop(),now; while(now = arrs.pop()){for( var i = 0 , len = save.length; i < len; i++ ){ now[i] = save[i];}save = now; } var result = save.sort(function(a,b){return a.key - b.key; }); return result;}arrayExtends([{key:1,name:'zz'}],[{key:2,name:'zz'},{key:3,name:'zz'}]);
相關(guān)文章:
1. WEB-INF / classes /與WEB-INF / lib / *。jar在類路徑優(yōu)先級?2. javascript - js 寫一個正則 提取文本中的數(shù)據(jù)3. yii2中restful配置好后在nginx下報404錯誤4. javascript - 關(guān)于Lazyload遇到的問題5. 算法 - python 給定一個正整數(shù)a和一個包含任意個正整數(shù)的 列表 b,求所有<=a 的加法組合6. android 如何實現(xiàn)如圖中的鍵盤上的公式及edittext的內(nèi)容展示呢7. ruby - gitlab托管,git clone 失敗?8. c++ - 如何正確的使用QWebEngineView?9. angular.js - react的redux和vue的vuex,angular呢10. java - 我在用Struts2上傳文件時,報以下錯誤怎么回事?
