java 常用的数据结构的迭代

ArrayList 底层是由数组实现 高查找 低修改
LinkedList 底层是链表结构 低查找 高修改

迭代程序:
List ls = new LinkedList();
String a = "a";
String b = "b";
ls.add(a);
ls.add(b);
Iterator it = ls.iterator();
while (it.hasNext()) {
System.out.println("LinkedList:" + it.next());
}

List as = new ArrayList();
as.add("c");
as.add("d");
Iterator it1 = as.listIterator();

while (it1.hasNext()) {
System.out.println("ArrayList中的值:" + it1.next());
}

Map map = new HashMap();
map.put("name", "lwang");
map.put("age", "24");
map.put("sex", "男");
map.put("email", "234@qq.com");
Set set = new HashSet();
Set set2 = new HashSet();
set = map.keySet();//
Iterator it2 = set.iterator();
while (it2.hasNext()) {
String key = (String) it2.next();
System.out.println("map的键值:" + key);

set2.add(map.get(key));//
}

Iterator it3 = set2.iterator();
while (it3.hasNext()) {
System.out.println("map中的值:" + it3.next());
}