java基础积累---map的遍历
package com.fjf.test;
import java.util.HashMap;
import java.util.Iterator;
import java.util.Map;
import java.util.Map.Entry;
import java.util.Set;
public class testmap1 {
public static void main(String[] args) {
Map map = new HashMap<Integer, String>();
map.put(1,"fjf");
map.put(2,"sb");
map.put(3,"sqq");
//遍历map 方法1
Set<Integer> keyset = map.keySet();
Iterator<Integer> it = keyset.iterator();
while(it.hasNext()){
// 找到键值
Integer key=it.next();
// 找到键值所对应的值 map.get(key)
String value=(String) map.get(key);
// 输出数组
System.out.println(key+"->"+value);
}
//遍历map 方法2
Set<Entry<Integer, String>> entryset = map.entrySet();
Iterator<Entry<Integer, String>> lt = entryset.iterator();
while(lt.hasNext()){
Entry<Integer, String> entry= lt.next();
System.out.println(entry.getKey()+"-->"+entry.getValue());
}
//遍历map 方法3
for (Object key : map.keySet()) {
System.out.println(key+"-->"+map.get(key));
}
//4
for (Object v : map.values()) {
System.out.println(v);
}
}
import java.util.HashMap;
import java.util.Iterator;
import java.util.Map;
import java.util.Map.Entry;
import java.util.Set;
public class testmap1 {
public static void main(String[] args) {
Map map = new HashMap<Integer, String>();
map.put(1,"fjf");
map.put(2,"sb");
map.put(3,"sqq");
//遍历map 方法1
Set<Integer> keyset = map.keySet();
Iterator<Integer> it = keyset.iterator();
while(it.hasNext()){
// 找到键值
Integer key=it.next();
// 找到键值所对应的值 map.get(key)
String value=(String) map.get(key);
// 输出数组
System.out.println(key+"->"+value);
}
//遍历map 方法2
Set<Entry<Integer, String>> entryset = map.entrySet();
Iterator<Entry<Integer, String>> lt = entryset.iterator();
while(lt.hasNext()){
Entry<Integer, String> entry= lt.next();
System.out.println(entry.getKey()+"-->"+entry.getValue());
}
//遍历map 方法3
for (Object key : map.keySet()) {
System.out.println(key+"-->"+map.get(key));
}
//4
for (Object v : map.values()) {
System.out.println(v);
}
}
}