報(bào)錯(cuò)：array is undefined 求指正**
<!DOCTYPE?html>
<head>
????<meta?charset?=?'utf-8'>
????<title>判斷數(shù)組相似</title>
</head>
<body>
????<div>
????????<h1>Hello?World!</h1>
????</div>
????<script?type?=?'text/javascript'>
????????/*首先定義一個(gè)函數(shù)*/
????????function?arraysSimilar(arr1,arr2){
????????????if(!(arr1?instanceof?array)||!(arr2?instanceof?array))
????????????????return?false;
????????????if(arr1.length!==arr2.length)
????????????????return?false;
????????????var?i,
????????????????arr1Type?=?{},
????????????????arr2Type?=?{};
????????????for(i=0;i<arr1.length;i++)
????????????????{
?????????????????????if(typeof(arr1[i])){
?????????????????????????arr1Type[i]?=?typeof(arr1[i]);}
?????????????????????if(typeof(arr2[i])){
?????????????????????????arr2Type[i]?=?typeof(arr2[i]);}
????????????????}
????????????arr1Type.sort();arr2Type.sort();
????????????if(arr1Type.sort().join()?===?arr2Type.sort().join()){
????????????????return?true;}
????????????????else{return?false;}
????????????}
????????????arr1?=?[1,5,undefined,true],
????????????arr2?=?[2,false,8];
????????????arraysSimilar(arr1,arr2);
????????/*第一步判斷是否都為數(shù)組*/
????????/*第二步判斷長度是否相等*/
????????/*第三步新建兩個(gè)數(shù)組放入數(shù)據(jù)類型*/
????????/*第四步將數(shù)組排序變成字符串然后比較*/
????</script>
</body>初學(xué)，所以暫時(shí)沒有按照題目要求嚴(yán)格區(qū)分?jǐn)?shù)據(jù)類型。
報(bào)錯(cuò)：array is undefined
代碼應(yīng)該還有一些問題，求大神指正**
2018-12-22
js區(qū)分大小寫 Array是關(guān)鍵字? var a 和 var A是兩個(gè)變量
2018-09-17
<!DOCTYPE?html> <head> ????<meta?charset?=?'utf-8'> ????<script?src?='testData.js'></script> ????<title>判斷數(shù)組相似</title> </head> <body> ????<div> ????????<h1>Hello?World!</h1> ????</div> ????<script> ????????function?arraysSimilar(arr1,arr2){ ????????/*第一步判斷是否都為數(shù)組*/ ????????/*第二步判斷長度是否相等*/ ????????/*第三步新建兩個(gè)數(shù)組放入數(shù)據(jù)類型*/ ????????/*第四步將數(shù)組排序變成字符串然后比較*/ ????????????var?i, ????????????arr1Type?=?[], ????????????arr2Type?=?[]; ????????????if(!(arr1?instanceof?Array)?||?!(arr2?instanceof?Array)) ????????????????return?false; ????????????if(arr1.length!==arr2.length) ????????????????return?false; ????????????for(i=0;i<arr1.length;i++) ????????????????{arr1Type.push(typeof(arr1[i])); ?????????????????arr2Type.push(typeof(arr2[i]));} ????????????if(arr1Type.sort().join()?===?arr2Type.sort().join()) ????????????????{return?true;} ????????????else{return?false;} ????????????} ????</script>2018-09-12
把
arr1?instanceof?array和arr2instanceof?array中的'array'改為'Array'，數(shù)組對(duì)象寫錯(cuò)了呢2018-09-10
<!DOCTYPE?HTML><html><head>????<meta?http-equiv="Content-Type"?content="text/html;?charset=utf-8">????<title>Untitled?Document</title></head><body>????<script?type="text/javascript">???????????/*?????????*?param1?Array??????????*?param2?Array?????????*?return?true?or?false?????????*/?????????????????//?類型檢測(cè)????????let?typing?=?function(el)?{????????????return?Object.prototype.toString.apply(el).toLowerCase().replace(/\S+\s|\]/g,?'')????????}?????????????????function?arraysSimilar(arr1,?arr2){???????? //?arr1/arr2?無效值判斷????????????if?(!arr1?||?!arr2)?{???????????? return?false;????????????}????????????//?是否為數(shù)組????????????if?(typing(arr1)?!=?'array'?||?typing(arr2)?!=?'array')?{???????????? if?(arr1?!=?arr2)?{???????????? return?false;???????????? }????????????}?else?{???????????? /*長度判斷*/???????????? if?(arr1.length?!=?arr2.length)?{???????????? return?false;???????????? }???????????? let?_arr1?=?arr1.map(item?=>?typing(item));???????????? let?_arr2?=?arr2.map(item?=>?typing(item));???????????? _arr1.sort();???????????? _arr2.sort();???????????? /*類型判斷*/???????????? for(let?i?=?0;?i?<?_arr1.length;?i++)?{???????????? if?(_arr1[i]?!=?_arr2[i])?{???????????? return?false;???????????? }???????????? }????????????}????????????return?true;????????}????</script>????<script?src="testData.js"></script></body></html>2018-09-10
<!DOCTYPE?HTML><html><head>????<meta?http-equiv="Content-Type"?content="text/html;?charset=utf-8">????<title>Untitled?Document</title></head><body>????<script?type="text/javascript">???????????/*?????????*?param1?Array??????????*?param2?Array?????????*?return?true?or?false?????????*/?????????????????//?類型檢測(cè)????????let?typing?=?function(el)?{????????????return?Object.prototype.toString.apply(el).toLowerCase().replace(/\S+\s|\]/g,?'')????????}?????????????????function?arraysSimilar(arr1,?arr2){???????? //?arr1/arr2?無效值判斷????????????if?(!arr1?||?!arr2)?{???????????? return?false;????????????}????????????//?是否為數(shù)組????????????if?(typing(arr1)?!=?'array'?||?typing(arr2)?!=?'array')?{???????????? if?(arr1?!=?arr2)?{???????????? return?false;???????????? }????????????}?else?{???????????? /*長度判斷*/???????????? if?(arr1.length?!=?arr2.length)?{???????????? return?false;???????????? }???????????? let?_arr1?=?arr1.map(item?=>?typing(item));???????????? let?_arr2?=?arr2.map(item?=>?typing(item));???????????? _arr1.sort();???????????? _arr2.sort();???????????? /*類型判斷*/???????????? for(let?i?=?0;?i?<?_arr1.length;?i++)?{???????????? if?(_arr1[i]?!=?_arr2[i])?{???????????? return?false;???????????? }???????????? }????????????}????????????return?true;????????}????</script>????<script?src="testData.js"></script></body></html>