3. 实现List和Map数据的转换。具体要求如下:
功能1:定义方法public void listToMap( ){ }将List中Student元素封装到Map中
1) 使用构造方法Student(int id,String name,int age,String sex )创建多个学生信息并加入List;
2) 遍历List,输出每个Student信息;
3) 将List中数据放入Map,使用Student的id属性作为key,使用Student对象信息作为value;
4) 遍历Map,输出每个Entry的key和value。
功能2:定义方法public void mapToList( ){ }将Map中Student映射信息封装到List
1) 创建实体类StudentEntry,可以存储Map中每个Entry的信息;
2) 使用构造方法Student(int id,String name,int age,String sex )创建多个学生信息,并使用Student的id属性作为key,存入Map;
3) 创建List对象,每个元素类型是StudentEntry;
4) 将Map中每个Entry信息放入List对象。
功能3:说明Comparable接口的作用,并通过分数来对学生进行排序。
import java.util.ArrayList;
import java.util.HashMap;
import java.util.Iterator;
import java.util.List;
import java.util.Map;
import java.util.Map.Entry;
import java.util.Set;
import java.util.TreeSet;
public class TestStudent {
public static void main(String[] args) {
listToMap();
mapToList();
sortToMap();
}
public static void listToMap() {//数组转换成map
Student s1 = new Student(1,"apple",22,"male");
Student s2 = new Student(2,"banana",33,"female");
Student s3 = new Student(3,"orange",12,"male");
Student s4 = new Student(4,"pineapple",43,"female");
List<Student> list = new ArrayList<Student>();
list.add(s1);
list.add(s2);
list.add(s3);
list.add(s4);
for (Student student : list) {
System.out.println(student);
}
Map<Integer, Student> map1 = new HashMap<Integer, Student>();
for (Student student : list) {
map1.put(student.id, student);
}
Set<Entry<Integer, Student>> set = map1.entrySet();
for (Iterator<Entry<Integer, Student>> iter = set.iterator();iter.hasNext();) {
Entry<Integer, Student> s = iter.next();
Student student = s.getValue();
System.out.println(student);
}
}
public static void mapToList() {//map转换成数组
Student s1 = new Student(1,"apple",22,"male");
Student s2 = new Student(2,"banana",33,"female");
Student s3 = new Student(3,"orange",12,"male");
Student s4 = new Student(4,"pineapple",43,"female");
Map<Integer, Student> map2 = new HashMap<Integer, Student>();
map2.put(1, s1);
map2.put(2, s2);
map2.put(3, s3);
map2.put(4, s4);
List<StudentEntry> list2 = new ArrayList<StudentEntry>();
Set<Entry<Integer, Student>> set2 = map2.entrySet();
for (Iterator<Entry<Integer, Student>> iter = set2.iterator();iter.hasNext();) {
Entry<Integer, Student> s = iter.next();
StudentEntry se = new StudentEntry(s.getKey(),s.getValue());
list2.add(se);
}
for (Iterator<StudentEntry> iter = list2.iterator();iter.hasNext();) {
StudentEntry s = iter.next();
Student student = s.getStudent();
System.out.println(student);
}
}
public static void sortToMap() {//有序排列的map
Student s1 = new Student(1,"apple",22,"male");
Student s4 = new Student(4,"pineapple",43,"female");
Student s2 = new Student(2,"banana",33,"female");
Student s3 = new Student(3,"orange",12,"male");
Set<Student> set4 = new TreeSet<Student>();
set4.add(s1);
set4.add(s2);
set4.add(s3);
set4.add(s4);
for (Student student : set4) {
System.out.println(student);
}
}
}
class Student implements Comparable<Student>{//学生类
int id;
String name;
int age;
String sex;
public Student() {
}
public Student(int id, String name, int age, String sex) {
super();
this.id = id;
this.name = name;
this.age = age;
this.sex = sex;
}
@Override
public int compareTo(Student o) {//重写Comparable接口,按年龄排序
if (this.age < o.age) {
return 1;
}else if (this.age > o.age) {
return -1;
}else {
return 0;
}
}
@Override
public String toString() {
return "id:" + id + "\t"+ "name:" + name+ "\t" + "age:" + age + "\t" + "sex:" + sex;
}
}
class StudentEntry{
private int key;
private Student student;
public StudentEntry() {
}
public StudentEntry(int key, Student student) {
super();
this.key = key;
this.student = student;
}
public int getKey() {
return key;
}
public void setKey(int key) {
this.key = key;
}
public Student getStudent() {
return student;
}
public void setStudent(Student student) {
this.student = student;
}
}