//案例 // .已知数组存放一批QQ号码,QQ号码最长为11位,
1先把数组转为集合。
String[] strs ={"12345","67891","12347809933","98765432102","67891","12347809933"}; LinkedList<String>list=new LinkedList<>(); Collections.addAll(list,strs);
2 增强for去重后集合中的元素
for (String msg : list) { if (!newlist.contains(msg)) { newlist.add(msg); } } System.out.println("增强for去重后集合中的元素:"+newlist);
3 迭代器去重后集合中的元素
ListIterator<String>it=list.listIterator(); while (it.hasNext()){ String msg=it.next(); if (!newlist.contains(msg)){ newlist.add(msg); } } System.out.println("迭代器去重后集合中的元素:"+newlist);
4 for去重后集合中的元素
for (int i=0;i<list.size();i++){ String msg=list.get(i); if (!newlist.contains(msg)){ newlist.add(msg); } } System.out.println("for去重后集合中的元素:"+newlist); System.out.println("--------------------------------------");