TreeSet存储Student类型并按照年龄排序

import java.util.*;

public class ListItetator {
    public static void main(String[] args) {


        ArrayList<String> list = new ArrayList<String>();
        list.add(0, "hello");
        list.add(1, "world");
        list.add(2, "java");
        LinkedList<String> ssr = new LinkedList<String>();
        ssr.add("qing");
        ssr.add("yong");
        ssr.add("keen");

        List<Student> st = new ArrayList<Student>();

        HashSet<String> set = new HashSet<>();
      /*  Iterator<String> ii = set.iterator();
        set.add("guojiewen");
        set.add("chengkuan");
        set.add("yuyong");
        set.add("yuyong");
        //System.out.println(set.hashCode());
        //System.out.println(set);
        for (String ss : set) {
            System.out.println(ss+"  "+ss.hashCode());
        }
        while (ii.hasNext()) {
            System.out.println(ii.next());

        }
*/
//HashSet<Student> hs =new HashSet();
        TreeSet<Student> ts =new TreeSet<Student>(new Comparator<Student>() {
            @Override
            public int compare(Student o1, Student o2) {
                int num=(o1.getAge().compareTo(o2.getAge()));
                int num2=num==0?(o1.getName().compareTo(o2.getName())):num;
                return num2;
            }
        });

        //String sid, String name, String age, String address)
        Student s1 = new Student("001", "ling", "31", "shenzhen");
        ts.add(s1);
        Student s2 = new Student("002", "Qing", "32", "shenzhen");
        ts.add(s2);
        Student s3 = new Student("003", "yong", "30", "shenzhen");
        ts.add(s3);
        Student s4 = new Student("003", "rfff", "30", "shenzhen");
        ts.add(s4);
       /* ListIterator<Student> i = st.listIterator();
        Iterator<String> iii = ssr.iterator();*/

        for(Student ss :ts){
            System.out.println(ss.getSid()+" "+ss.getName()+" "+ss.getAge());
        }

       /* for(String str :ssr){
            System.out.println(str);












        }
        System.out.println("--------------->");
        while(ii.hasNext()){
            System.out.println(ii.next());

        }
        System.out.println("--------------->");
        ssr.addFirst("yu");
        ssr.addLast("yu");
        ssr.removeFirst();
        ssr.removeLast();
        System.out.println(ssr);
        System.out.println(ssr.getFirst());
        System.out.println(ssr.getLast());*/

     /*   for(int j=0;j<ssr.size();j++){
            System.out.println(ssr.get(j));
        }
        for (Student ll : st) {
            System.out.println(ll);
        }
        while (i.hasNext()) {
            Student aa = i.next();
            System.out.println(aa);
        }
        for(int j=0;j<list.size();j++){
            System.out.println(st.get(j));

        }*/

    }


}

 

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值