瘋小蕾
2017-03-21 23:29:38
function main(arr1,arr2){ var arrn=new Array(); var k=0; for(i=0;i<arr1.length;i++){ for(j=0;j<arr2.length;j++){ if(arr1[i]==arr2[j]){ arrn.push(arr2[j]); } } return arrn;}}?var b=[1,2,3,4];?var c=[3,5,2,4]; console.log(main(b,c));
3 回答
已采納

千秋此意
TA貢獻(xiàn)158條經(jīng)驗(yàn) 獲得超188個(gè)贊
把 return 往下移兩行,你丟到for循環(huán)里了,也就是第一次循環(huán)就直接return了,后面的直接不執(zhí)行了
——————————————————————————
感謝采納,也補(bǔ)充個(gè)寫(xiě)法吧,順便說(shuō)下你問(wèn)的關(guān)于indexOf方法,
String.prototype.indexOf()和Array.prototype.indexOf()是兩個(gè)方法,不過(guò)作用類(lèi)似。
數(shù)組的indexOf方法語(yǔ)法為arr.indexOf(ele, idx),將返回arr中ele首次出現(xiàn)的索引值,如果找不到則返回-1,idx是開(kāi)始搜索的位置, 默認(rèn)為0。
function?intersect(a,?b)?{ ????return?function(res,?idx)?{ ????????return?idx?<?a.length???arguments.callee(res.concat((!res.includes(a[idx])?&&?b.includes(a[idx]))???a[idx]?:?[]),?++idx)?:?res; ????}([],?0) } var?b?=?[1,?2,2,?3,?4]; var?c?=?[3,?5,?2,?4]; var?result?=?intersect(b,?c); console.log(result);?//?=>?[?2,?3,?4?]

西蘭花偉大炮
TA貢獻(xiàn)376條經(jīng)驗(yàn) 獲得超318個(gè)贊
<!DOCTYPE?html> <html> ????<head> ????????<meta?charset="UTF-8"> ????????<title></title> ????</head> ????<body> ????????<script> ????????????function?compareArr(arr1,arr2){ ????????????????var?arr_mid?=?[]; ????????????????for?(var?i?=?0;i?<?arr2.length;i++)?{ ????????????????????if(arr1.indexOf(arr2[i])?!=?-1){ ????????????????????????arr_mid.push(arr2[i]); ????????????????????} ????????????????} ????????????????return?arr_mid; ????????????} ????????????arr1??=?[1,2,4,6,7,9]; ????????????arr2?=?[1,3,5,6,7,8]; ????????????console.log(compareArr(arr1,arr2)); ????????</script> ????</body> </html>
另外一個(gè)思路,旅行者說(shuō)的是正確的
添加回答
舉報(bào)
0/150
提交
取消