java姓名排序_java-按照学生姓名排序

import java.util.Comparator;

import java.util.HashMap;

import java.util.Iterator;

import java.util.TreeMap;

public class fanxing {

public static void main(String args[]) {

TreeMap tm=new TreeMap(new MyCompl());

tm.put(new Student("a", 19), "shandong");

tm.put(new Student("a", 18), "tianjin");

tm.put(new Student("lisi", 19), "beijing");

tm.put(new Student("wangwu", 24), "chengdu");

tm.put(new Student("zhaoliu", 20), "shenyang");

tm.put(new Student("sunsi", 21), "shandong");

HashMap hm = new HashMap();

hm.put(new Student("hzhangsan", 19), "shandong");

hm.put(new Student("hzhangsan", 19), "tianjin");

hm.put(new Student("hlisi", 19), "beijing");

hm.put(new Student("hwangwu", 24), "chengdu");

hm.put(new Student("hzhaoliu", 20), "shenyang");

hm.put(new Student("hsunsi", 21), "shandong");

Iterator it = tm.keySet().iterator();

while (it.hasNext()) {

Student stu = it.next();

String name = stu.getName();

int age = stu.getAge();

String addr=tm.get(stu);

System.out.println(name + ":" + age+":"+addr);

}

Iterator itor = hm.keySet().iterator();

while (itor.hasNext()) {

Student stu = itor.next();

String name = stu.getName();

int age = stu.getAge();

String addr=hm.get(stu);

System.out.println(name + ":" + age+":"+addr);

}

}

}

class MyCompl implements Comparator{

public int compare(Student o1, Student o2) {

int num= o1.getName().compareTo(o2.getName());

if(num==0){

return o1.getAge()-o2.getAge();

}

return num;

}

}

class Student implements Comparable {

private String name;

private int age;

Student(String name, int age) {

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;

}

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;

}

}

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值