import java.util.Arrays;
import java.util.Collection;
import java.util.HashMap;
import java.util.Map;
import java.util.UUID;
public class User implements Comparable
{
private String id;
private String name;
private int age;
public User(String name, int age)
{
this.id = UUID.randomUUID().toString();
this.name = name;
this.age = age;
}
public String getId()
{
return id;
}
public String getName()
{
return name;
}
public void setName(String name)
{
this.name = name;
}
public void setAge(int age)
{
this.age = age;
}
public int getAge()
{
return age;
}
public void print()
{
System.out.println(this.id + " " + this.name + " " + this.age);
}
public int compareTo(Object o)
{
if (o instanceof User)
{
User temp = (User) o;
if (temp.getAge() > this.age)
{
return -1;
} else if (temp.getAge() < this.age)
{
return 1;
} else
{
return 0;
}
}
return 1;
}
public static void main(String[] args)
{
Map<String, User> hm = new HashMap<String, User>();
User u1 = new User("11", 12);
User u2 = new User("22", 13);
User u3 = new User("33", 15);
User u4 = new User("55", 68);
User u5 = new User("98", 30);
User u6 = new User("45", 55);
User u7 = new User("333", 6);
User u8 = new User("我的名字", 8);
hm.put(u1.getId(), u1);
hm.put(u2.getId(), u2);
hm.put(u3.getId(), u3);
hm.put(u4.getId(), u4);
hm.put(u5.getId(), u5);
hm.put(u6.getId(), u6);
hm.put(u7.getId(), u7);
hm.put(u8.getId(), u8);
Collection<User> c = hm.values();
Object[] users = c.toArray();
Arrays.sort(users);
for (Object user : users)
{
User u=(User) user;
u.print();
}
}
}
以上是我的解法,呵呵,欢迎大家拍砖。。。。。。