Map集合的遍历(方式1):
1:获取所有键的集合。用keySet()方法实现
2:遍历键的集合,获取到每一个键。 用增强for实现
3:根据键去找值。用get(Object key)方法实现
public static void main(String[] args) {
Map<String, String> map = new HashMap<>();
map.put("001", "小明");
map.put("002", "小红");
map.put("003", "小黑");
System.out.println(map);
Set<String> keySet = map.keySet();
for (String key : keySet) {
String value = map.get(key);
System.out.println(key + value);
}
Map集合遍历(方式2):
-
获取所有键值对对象的集合
Set<Map.Entry<K,V> > entrySet():获取所有键值对对象的集合 -
遍历键值对对象的集合,得到每一个键值对对象
用增强for实现,得到每一个Map.Entry -
根据键值对对象获取键和值
用getKey()得到键
用getValue()得到值
Map<String, String> map = new HashMap<>();
map.put("001", "小明");
map.put("002", "小红");
map.put("003", "小黑");
System.out.println(map);
Set<Entry<String,String>> entrySet = map.entrySet();
for(Entry<String,String> me : entrySet) {
String key = me.getKey();
String value = me.getValue();
System.out.println(key+value);
Map集合遍历(方式3):Lambda表达式
Map<String,Integer> map = new HashMap<>();
map.put("abc",12);
map.put("asdsad",126);
map.put("abwqe",16);
map.put("bdab",132);
map.put("awdawd",13);
map.forEach((k,v) ->{
System.out.println(k+"->"+v);
});
HashMap存储集合对象并遍历
案例1:创建HashMap,存储三个学生对象
HashMap<String, Student> hs = new HashMap<>();
Student s1 = new Student("小明", 21);
Student s2 = new Student("小红", 22);
Student s3 = new Student("小黑", 23);
hs.put("001", s1);
hs.put("002", s2);
hs.put("003", s3);
Set<String> keySet = hs.keySet();
for (String key : keySet) {
Student value = hs.get(key);
System.out.println(key + value.getName() + value.getAge());
}
System.out.println("--------");
Set<Entry<String, Student>> entrySet = hs.entrySet();
for (Entry<String, Student> en : entrySet) {
String key = en.getKey();
Student value = en.getValue();
System.out.println(key + value.getName() + value.getAge());
}
public class Student {
private String name;
private int age;
public Student() {
}
public Student(String name, int age) {
super();
this.name = name;
this.age = age;
}
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
public int getAge() {
return age;
}
public void setAge(int age) {
this.age = age;
}
}
案例2:
- 创建一个HashMap集合,键是学生对象(Student), 值是居住地(String)。
存储多个键值对元素,并遍历。 - 要求保证键的唯一性: 如果学生对象的成员变量值相同,我们就认为是同一个对象;
- 重写HashCode和equals方法确保唯一性
public class Student {
private String name;
private int age;
public Student() {
}
public Student(String name, int age) {
super();
this.name = name;
this.age = age;
}
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
public int getAge() {
return age;
}
public void setAge(int age) {
this.age = age;
}
@Override
public int hashCode() {
final int prime = 31;
int result = 1;
result = prime * result + age;
result = prime * result + ((name == null) ? 0 : name.hashCode());
return result;
}
@Override
public boolean equals(Object obj) {
if (this == obj)
return true;
if (obj == null)
return false;
if (getClass() != obj.getClass())
return false;
Student other = (Student) obj;
if (age != other.age)
return false;
if (name == null) {
if (other.name != null)
return false;
} else if (!name.equals(other.name))
return false;
return true;
}
}
public class Test {
public static void main(String[] args) {
HashMap<Student, String> hs = new HashMap<>();
Student s1 = new Student("小明", 21);
Student s2 = new Student("小黑", 22);
Student s3 = new Student("小黑", 22);
hs.put(s1, "中国");
hs.put(s2, "非洲");
hs.put(s3, "非洲");
Set<Student> keySet = hs.keySet();
for (Student key : keySet) {
String value = hs.get(key);
System.out.println(key.getName() + key.getAge() + value);
}
/*
* 小明21中国 小黑22非洲
*/
}
}