数组对象常用处理方案(算法思路)
生活随笔
收集整理的這篇文章主要介紹了
数组对象常用处理方案(算法思路)
小編覺得挺不錯(cuò)的,現(xiàn)在分享給大家,幫大家做個(gè)參考.
(1)依據(jù)數(shù)組對(duì)象中某個(gè)值,將相同的對(duì)象合并成一個(gè)新對(duì)象
數(shù)據(jù)源是這樣的
beforeData: [{ name: "tony", id: "1", age: "20" },{ name: "jack", id: "2", age: "21" },{ name: "tony", id: "3", age: "50" },{ name: "jack", id: "4", age: "10" },{ name: "mark", id: "5", age: "22" },{ name: "mark", id: "6", age: "40" }]要將數(shù)據(jù)中name相同的項(xiàng)合并成一個(gè)對(duì)象
afterData: [{name: "tony",origin: [{ name: "tony", id: "1", age: "20" },{ name: "tony", id: "3", age: "50" }]},{name: "jack",origin: [{ name: "jack", id: "2", age: "21" },{ name: "jack", id: "4", age: "10" }]},{name: "mark",origin: [{ name: "mark", id: "5", age: "22" },{ name: "mark", id: "6", age: "40" }]}]實(shí)現(xiàn):
let tempArr = [];for (let i = 0; i < this.beforeData.length; i++) {if (tempArr.indexOf(this.beforeData[i].name) === -1) {this.afterData.push({name: this.beforeData[i].name,origin: [this.beforeData[i]]});tempArr.push(this.beforeData[i].name);} else {for (let j = 0; j < this.afterData.length; j++) {if (this.afterData[j].name == this.beforeData[i].name) {this.afterData[j].origin.push(this.beforeData[i]);break;}}}}(2)根據(jù)數(shù)組中對(duì)象的某一個(gè)屬性值進(jìn)行排序
如下代碼,根據(jù)數(shù)組對(duì)象中的age進(jìn)行排序
方式一:
var arr = [{name:'zopp',age:0},{name:'gpp',age:18},{name:'yjj',age:8} ];function compare(property){return function(a,b){var value1 = a[property];var value2 = b[property];return value1 - value2;} } console.log(arr.sort(compare('age')))方式二:
students:[{name:'baibai',age:32},{name:'xiaobai',age:30},{name:'gufan',age:21},{name:'King',age:45} ]//數(shù)組對(duì)象方法排序: function sortByKey(array, key) {return array.sort(function(a, b) {var x = a[key];var y = b[key];return ((x < y) ? -1 : ((x > y) ? 1 : 0));}) }//將相應(yīng)的數(shù)組對(duì)象傳入即可完成排序: sortByKey(students,age);(3)數(shù)組的值大小排序
如下代碼,將數(shù)組中的值進(jìn)行大小排序
let values = [1,2,3,6,4,8]; //小到大排序,如果需要由大到小,把返回的-1和1反過來就可以了 let compare = (x,y) => {if(x < y){return -1}else if(x > y){return 1;}else{return 0;} } console.log(values.sort(compare)); //[1, 2, 3, 4, 6, 8](4)數(shù)組中相同元素組合成一個(gè)新的數(shù)組
現(xiàn)在有一個(gè)這樣規(guī)律的數(shù)組,需求是把里面相同元素組合成一個(gè)新的數(shù)組;
arr=['1','1','1','2',,'3','4','5','5','6','6','7','8','9','9','10']結(jié)果是這樣的
newArr = [ [ "1" , "1" , "1" ] , [ "2" ] , [] , [ "3" ] , [ "4" ] , [ "5" , "5" ] , [ "6" , "6" ] , [ "7" ] , [ "8" ] , [ "9" , "9" ] , [ "10" ] ]實(shí)現(xiàn)方式:
var arr=['1','1','1','2',,'3','4','5','5','6','6','7', '8','9','9','10'];var newArr = [],tempArr = [];for(var i=0,j=arr.length;i<j;i++){if(arr[i] == arr[i+1]){tempArr.push(arr[i]);} else {tempArr.push(arr[i]);newArr.push(tempArr.slice(0));tempArr.length = 0;}}console.log(newArr);/*[ [ "1" , "1" , "1" ] , [ "2" ] , [] , [ "3" ] , [ "4" ] ,[ "5" , "5" ] , [ "6" , "6" ] , [ "7" ] , [ "8" ] , [ "9" , "9" ] , [ "10" ] ]*/總結(jié)
以上是生活随笔為你收集整理的数组对象常用处理方案(算法思路)的全部?jī)?nèi)容,希望文章能夠幫你解決所遇到的問題。
- 上一篇: js常用reduce方法
- 下一篇: 三星在韩国推出 89 英寸 Micro