去除list里面的重复项

HashMap noComMap = new HashMap();  
  Iterator iter = noComHm.keySet().iterator(); 
  while (iter.hasNext()) { 
   String key = iter.next(); 
   ArrayList list = (ArrayList)noComHm.get(key);
   list = removeDuplicateWithOrder(list);
   noComMap.put(key, list);
  }

验证过了,比较好使

 public static ArrayList removeDuplicateWithOrder(ArrayList arlList) {
  Set set = new HashSet();
  List newList = new ArrayList();
  for (Iterator iter = arlList.iterator(); iter.hasNext();) {
   Object element = iter.next();
   if (set.add(element))
    newList.add(element);
  }
  arlList.clear();
  arlList.addAll(newList);
  return arlList;
 }

---------------------------------------------------------------------------------------

方法二:

  ArrayList list = new ArrayList();
  list.add("1"); list.add("2"); list.add("2");
  System.out.println(list.size()); 
  Iterator it1 = list.iterator();
  Hashtable ht = new Hashtable();
  while(it1.hasNext()){
   Object obj = it1.next();
   ht.put(obj, obj);
  }

  Iterator it2 = ht.keySet().iterator();
 list = new ArrayList();
  while(it2.hasNext()){
   list.add(it2.next());
  }  

  System.out.println(list.size()); 

----------------------------------------------------------------------------------------

Two Methods to Remove Duplicates in an ArrayList 
Here are two methods that allow you to remove duplicates in an ArrayList. removeDuplicate does not maintain the order where as removeDuplicateWithOrder maintains the order with some performance overhead. 
两个方法移除arraylist中的重复值 
一种方法removeduplicate在移除不维持arraylist原来的顺序 
另一种方法removeDuplicateWithOrder维持原来顺序,但消耗运行时间 
1.The removeDuplicate Method: 
Java代码 

public static void removeDuplicate(ArrayList arlList)    
{    
HashSet h = new HashSet(arlList);    
arlList.clear();    
arlList.addAll(h);    
}  


public static void removeDuplicate(ArrayList arlList) 
{ 
HashSet h = new HashSet(arlList); 
arlList.clear(); 
arlList.addAll(h); 
}

2.The removeDuplicateWithOrder Method: 
Java代码 

public static void removeDuplicateWithOrder(ArrayList arlList)    
{    
Set set = new HashSet();    
List newList = new ArrayList();    
for (Iterator iter = arlList.iterator(); iter.hasNext(); )    
{    
Object element = iter.next();    
if (set.add(element)) newList.add(element);    
}    
arlList.clear();    
arlList.addAll(newList);    
} 
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值