遍历list
Collection<Integer> c= new ArrayList<Integer>(Arrays.asList(1,2,3,4,5));
Iterator it = c.iterator();
while(it.hasNext()){
System.out.println(it.next());
}
out:1 2 3 4 5
文氏图移除
Set<String> set1 = new HashSet<String>();
Collections.addAll(set1, "a b c d".split(" "));
Set<String> set2 = new HashSet<String>();
Collections.addAll(set2, "c d e f".split(" "));
set1.removeAll(set2);
System.out.println(set1);
out: a b
优先级队列
List<Integer>list = Arrays.asList(25,2,23,11,3,1,233,111,14,112);
// PriorityQueue<Integer> p = new PriorityQueue<>(list);
PriorityQueue<Integer> p = new PriorityQueue<>(list.size(), Collections.reverseOrder());
p.addAll(list);
System.out.println(p);
out:从大到小排序
适配器设计模式,只有类实现了iterable接口就可被foreach遍历
Map<Integer,String>map = new HashMap<Integer,String>();
map.put(1, "one");
map.put(2,"two");
map.put(3, "three");
for(Map.Entry<Integer, String> entry:map.entrySet()){//set 实现了iterable接口可被foreach遍历
System.out.println(entry.getKey()+": "+entry.getValue());
}