Java—遍历每个班级的所有学生,即一对多的关系

import java.util.ArrayList;
import java.util.Iterator;
import java.util.List;
import java.util.TreeMap;

public class fanxing {
	public static void main(String args[]) {
		TreeMap<String, List<Student>> tm = new TreeMap<String, List<Student>> ();
		
		List<Student> com01=new ArrayList<Student>();
		List<Student> com02=new ArrayList<Student>();
		com01.add(new Student("01","zhasan"));
		com01.add(new Student("02","lisi"));
		com01.add(new Student("03","wangwu"));
		
		com02.add(new Student("04","zhasawqn"));
		com02.add(new Student("02","liswqi"));
		com02.add(new Student("08","wangwudsa"));

		tm.put("com01",com01);
		tm.put("com02",com02);
		
		Iterator<String> it=tm.keySet().iterator();
		while(it.hasNext()){
			String banji=it.next();
			System.out.println(banji+":");
			getStuinfo(tm.get(banji));
		}
	}
	
	public static String getStuinfo(List<Student> list){
		Iterator<Student> it=list.iterator();
		while(it.hasNext()){
			Student stu=it.next();
			String id=stu.getId();
			String name=stu.getName();
			System.out.println( id+":::"+name);
		}
		return null;
	}
}

class Student implements Comparable<Student> {
	private String id;
	private String name;
	private int age;

	Student(String id, String name) {
		this.name = name;
		this.id = id;
	}

	public String getId() {
		return id;
	}

	public void setId(String id) {
		this.id = id;
	}

	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;
	}

	public boolean equals(Object obj) {
		if (!(obj instanceof Student))
			return false;
		Student s = (Student) obj;
		return this.name.equals(s.name) && this.age == s.age;
	}

	public int hashCode() {
		return name.hashCode() + age * 39;
	}

	public int compareTo(Student o) {
		int num = this.getAge() - o.getAge();
		if (num == 0) {
			return this.getName().compareTo(o.getName());
		}
		return num;
	}
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值