使用迭代器遍历集合
代码`import java.util.ArrayList;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Iterator;
import java.util.List;
import java.util.Map;
import java.util.Set;
public class iterator_test {
public static void main(String[] args) {
//List
List list = new ArrayList();
list.add(1);
list.add(2);
list.add(3);
Iterator ite_list = list.iterator();
while(ite_list.hasNext()){
int i = ite_list.next();
System.out.println(i);
}
//Set
Set set = new HashSet<>();
set.add(“a”);
set.add(“b”);
set.add(“c”);
Iterator ite_set = set.iterator();
while(ite_set.hasNext()){
String str = ite_set.next();
System.out.println(str);
}
//Map 由于map存放键值对,所以选择将map转为一个集合再进行遍历
Map<Integer,String> map = new HashMap<Integer,String>();
map.put(1, “a”);
map.put(2, “b”);
map.put(3, “c”);
Set<Map.Entry<Integer, String>> map_set = map.entrySet();
Iterator<Map.Entry<Integer, String>> ite_map = map_set.iterator();
while(ite_map.hasNext()){
Map.Entry<Integer, String> map_ent = ite_map.next();
System.out.println(map_ent);
}
}
}`