十年網(wǎng)站開發(fā)經(jīng)驗(yàn) + 多家企業(yè)客戶 + 靠譜的建站團(tuán)隊(duì)
量身定制 + 運(yùn)營維護(hù)+專業(yè)推廣+無憂售后,網(wǎng)站問題一站解決
javascript中遍歷數(shù)組有哪幾種方法?相信很多沒有經(jīng)驗(yàn)的人對(duì)此束手無策,為此本文總結(jié)了問題出現(xiàn)的原因和解決方法,通過這篇文章希望你能解決這個(gè)問題。
有幾種方法可以遍歷數(shù)組,下面將逐個(gè)羅列!
let index = 0; const array = [1, 2, 3, 4, 5]; while (index < array.length) { console.log(array[index]); index++; }
const array = [1,2,3,4,5]; for(let index=0;index
forEach
const array=[1,2,3,4,5]; array.forEach(function(current_value,index,array){ console.log(`At index ${index} in array ${array} the value is ${current_value}`) })
map
最后一個(gè)構(gòu)造很有用,但是不會(huì)返回新數(shù)組,這對(duì)于你的特定情況可能是不希望的。map通過對(duì)每個(gè)元素應(yīng)用一個(gè)函數(shù)然后返回新數(shù)組來解決此問題。
const array = [1,2,3,4,5]; const square = x =>Math.pow(x,2); const squares = array.map(square); console.log(`${array}`); console.log(`${squares}`)
reduce
reduce()方法對(duì)累加器和數(shù)組中的每個(gè)元素(從左到右)應(yīng)用一個(gè)函數(shù),以將其減小為單個(gè)值
const array = [1,2,3,4,5]; const sum = (x,y) => x + y; const array_sum = array.reduce(sum,0); console.log(`the sum of arrray:${array} is ${array_sum}`);
filter
根據(jù)布爾函數(shù)過濾篩選數(shù)組中的元素
const array = [1,2,3,4,5]; const even = x => x%2 === 0; const even_array = array.filter(even); console.log(`even numbers in array ${array} : ${even_array}`);
every
得到了一個(gè)數(shù)組,想測(cè)試每個(gè)元素是否滿足給定條件
const array = [1,2,3,4,5,8]; const under_six = x => x<6; if(array.every(under_six)){ console.log(`every elemnet in the array is less than 6`); } else{ console.log(`at least one element in the array was bigger than 6`); }
some
測(cè)試是否至少有一個(gè)元素與布爾函數(shù)匹配
const array = [2,4,5,6,8]; const over_five = x => x>5; if(array.some(over_five)){ console.log(`at least one element bigger than 5 was found`); } else{ console.log(`no element bigger than 5 was found`); }
到此就結(jié)束啦,如果還有其他的歡迎補(bǔ)充!
看完上述內(nèi)容,你們掌握javascript中遍歷數(shù)組有哪幾種方法的方法了嗎?如果還想學(xué)到更多技能或想了解更多相關(guān)內(nèi)容,歡迎關(guān)注創(chuàng)新互聯(lián)-成都網(wǎng)站建設(shè)公司行業(yè)資訊頻道,感謝各位的閱讀!
新聞標(biāo)題:javascript中遍歷數(shù)組有哪幾種方法-創(chuàng)新互聯(lián)
URL地址:http://m.jiaotiyi.com/article/djsdsh.html