数组去重方法速度对比

面试时经常被问到数组去重的问题,个人觉得这种问题其实没太大的作用,毕竟在实际工作中很少能遇到的很大的数组,所以不论以什么样的方式实现都很难做到内存的溢出及产生较大的耗时差距(除非你是故意)               今天咱们对比一下那个速度更快

function createTestArray(){

const testArray=[1,2,3,4,5,'a','b','c','d','e'];

for(let i=0;i<13;i++){

testArray.push(...testArray);

}

testArray.sort((a,b)=>Math.random()>0.5?1:-1);

//console.log(`testArray:${testArray},length:${testArray.length}`);

return testArray;

}

const testArray=createTestArray();

function showTime(fun){

const start=new Date();

const result=fun();

return `name:${fun.name},time:${new Date()-start},result:${result.join(',')}`;

}

function removeRepeatBySet(){

return [...new Set(testArray)];

}

function removeRepeatByFilter(){

return testArray.filter((item,index,arr)=>arr.indexOf(item)==index);

}

function removeRepeatByForof(){

const obj={},arr=[],value={};

for(let i of testArray){

if(obj[i]==value){

continue;

}else if(obj[i]!=value){

obj[i]=value;

arr.push(i);

}

}

return arr;

}

function removeRepeatByFor(){

const obj={},arr=[],value={};

for(let i= 0,len=testArray.length;i

const item=testArray[i];

if(obj[item]==value){

continue;

}else if(obj[item]!=value){

obj[item]=value;

arr.push(item);

}

}

return arr;

}

const results=[];

for(var i=0;i<10;i++){

results.push(

showTime(removeRepeatBySet),

showTime(removeRepeatByForof),

showTime(removeRepeatByFilter),

showTime(removeRepeatByFor)

);

}

console.log(JSON.stringify(results.sort(),null,4));

 

打印的结果

 

[

"name:removeRepeatByFilter,time:10,result:3,5,a,b,1,4,c,2,e,d",

"name:removeRepeatByFilter,time:10,result:3,5,a,b,1,4,c,2,e,d",

"name:removeRepeatByFilter,time:12,result:3,5,a,b,1,4,c,2,e,d",

"name:removeRepeatByFilter,time:6,result:3,5,a,b,1,4,c,2,e,d",

"name:removeRepeatByFilter,time:7,result:3,5,a,b,1,4,c,2,e,d",

"name:removeRepeatByFilter,time:7,result:3,5,a,b,1,4,c,2,e,d",

"name:removeRepeatByFilter,time:8,result:3,5,a,b,1,4,c,2,e,d",

"name:removeRepeatByFilter,time:9,result:3,5,a,b,1,4,c,2,e,d",

"name:removeRepeatByFilter,time:9,result:3,5,a,b,1,4,c,2,e,d",

"name:removeRepeatByFilter,time:9,result:3,5,a,b,1,4,c,2,e,d",

"name:removeRepeatByFor,time:2,result:3,5,a,b,1,4,c,2,e,d",

"name:removeRepeatByFor,time:3,result:3,5,a,b,1,4,c,2,e,d",

"name:removeRepeatByFor,time:3,result:3,5,a,b,1,4,c,2,e,d",

"name:removeRepeatByFor,time:3,result:3,5,a,b,1,4,c,2,e,d",

"name:removeRepeatByFor,time:3,result:3,5,a,b,1,4,c,2,e,d",

"name:removeRepeatByFor,time:4,result:3,5,a,b,1,4,c,2,e,d",

"name:removeRepeatByFor,time:4,result:3,5,a,b,1,4,c,2,e,d",

"name:removeRepeatByFor,time:4,result:3,5,a,b,1,4,c,2,e,d",

"name:removeRepeatByFor,time:5,result:3,5,a,b,1,4,c,2,e,d",

"name:removeRepeatByFor,time:6,result:3,5,a,b,1,4,c,2,e,d",

"name:removeRepeatByForof,time:11,result:3,5,a,b,1,4,c,2,e,d",

"name:removeRepeatByForof,time:6,result:3,5,a,b,1,4,c,2,e,d",

"name:removeRepeatByForof,time:6,result:3,5,a,b,1,4,c,2,e,d",

"name:removeRepeatByForof,time:7,result:3,5,a,b,1,4,c,2,e,d",

"name:removeRepeatByForof,time:8,result:3,5,a,b,1,4,c,2,e,d",

"name:removeRepeatByForof,time:8,result:3,5,a,b,1,4,c,2,e,d",

"name:removeRepeatByForof,time:8,result:3,5,a,b,1,4,c,2,e,d",

"name:removeRepeatByForof,time:9,result:3,5,a,b,1,4,c,2,e,d",

"name:removeRepeatByForof,time:9,result:3,5,a,b,1,4,c,2,e,d",

"name:removeRepeatByForof,time:9,result:3,5,a,b,1,4,c,2,e,d",

"name:removeRepeatBySet,time:10,result:3,5,a,b,1,4,c,2,e,d",

"name:removeRepeatBySet,time:13,result:3,5,a,b,1,4,c,2,e,d",

"name:removeRepeatBySet,time:16,result:3,5,a,b,1,4,c,2,e,d",

"name:removeRepeatBySet,time:6,result:3,5,a,b,1,4,c,2,e,d",

"name:removeRepeatBySet,time:7,result:3,5,a,b,1,4,c,2,e,d",

"name:removeRepeatBySet,time:7,result:3,5,a,b,1,4,c,2,e,d",

"name:removeRepeatBySet,time:8,result:3,5,a,b,1,4,c,2,e,d",

"name:removeRepeatBySet,time:9,result:3,5,a,b,1,4,c,2,e,d",

"name:removeRepeatBySet,time:9,result:3,5,a,b,1,4,c,2,e,d",

"name:removeRepeatBySet,time:9,result:3,5,a,b,1,4,c,2,e,d"

]

此时我们可以看出。  for循环是用时最少的,其次for of,filter,而es6的Set用时最长

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
有多种方法可以在Java中对数组进行去重。这里提供了两种常用的方法。 第一种方法是使用HashSet。HashSet是一种基于哈希表实现的Set接口,可以用来存储不重复的元素。我们可以通过遍历数组中的每个元素,将其添加到HashSet中,由于HashSet中不能存储重复元素,所以最终HashSet中的元素就是数组去重后的结果。但需要注意的是,HashSet中的数据是无序的。 第二种方法是使用List集合。我们可以创建一个List集合,然后遍历数组中的元素,判断该元素是否已存在于集合中,如果不存在则将其添加到集合中。这样最终List集合中的元素就是数组去重后的结果。需要注意的是,List集合可以保持元素的插入顺序,因此可以保留原本的顺序。 这里是具体的代码示例: 使用HashSet去重: ```java int[] arr = {1, 2, 4, 4, 5, 5, 6, 7, 8}; Set<Integer> set = new HashSet<>(); for (int i = 0; i < arr.length; i++) { set.add(arr[i]); } ``` 使用List集合去重并保留原本顺序: ```java int[] arr = {1, 2, 4, 4, 5, 5, 6, 7, 8}; List<Integer> list = new ArrayList<>(); for (int i = 0; i < arr.length; i++) { if (!list.contains(arr[i])) { list.add(arr[i]); } } ``` 以上是两种常用的Java数组去重方法,你可以根据具体的需求选择适合你的方法。<span class="em">1</span><span class="em">2</span><span class="em">3</span> #### 引用[.reference_title] - *1* *3* [Java基础:数组去重方法](https://blog.csdn.net/wangshiqi666/article/details/130228023)[target="_blank" data-report-click={"spm":"1018.2226.3001.9630","extra":{"utm_source":"vip_chatgpt_common_search_pc_result","utm_medium":"distribute.pc_search_result.none-task-cask-2~all~insert_cask~default-1-null.142^v93^chatsearchT3_1"}}] [.reference_item style="max-width: 50%"] - *2* [JAVA数组去重方法](https://blog.csdn.net/weixin_55076626/article/details/129674222)[target="_blank" data-report-click={"spm":"1018.2226.3001.9630","extra":{"utm_source":"vip_chatgpt_common_search_pc_result","utm_medium":"distribute.pc_search_result.none-task-cask-2~all~insert_cask~default-1-null.142^v93^chatsearchT3_1"}}] [.reference_item style="max-width: 50%"] [ .reference_list ]
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值