// 数组去重2.构造一个mapconst arr =[2,4,5,2,4,7,9,1,9,500];functiongetUniqueArray(arr){var result ={};
arr.forEach((v)=>{
result[v]=1;});return Object.keys(result).map(item =>{returnparseInt(item);});}
// 数组去重3.比较巧妙的用了两个for循环const arr =[2,4,5,2,4,7,9,1,9,500];constgetUniqueArray=(arr)=>{var result =[];var flag;for(let i =0; i < arr.length; i++){
flag =false;for(let j = i +1; j < arr.length; j++){if(arr[i]=== arr[j]){
flag =true;}}if(!flag){
result.push(arr[i]);}}}
// 数组去重4.先排序,然后比较相邻的是否相同const arr =[2,4,5,2,4,7,9,1,9,500];constgetUniqueArray=(arr)=>{const result =[];
arr.sort((first, second)=>{return(first - second);});for(let i =0; i < arr.length; i++){if(arr[i]!== arr[i +1]){
result.push(arr[i]);}}return result;}