2020.02.23 Comparator接口

标签：tor   for   class   str   ring   view   pareto   play   else   

bean

package com.guoyun.bean;

/**
 * ClassName:
 * Function:  ADD FUNCTION
 * Reason:   ADD REASON
 *
 * @author
 * @Date
 * @since Ver 1.1
 */
public class MusicBean {
    //歌曲名称
    public String name;
    //播放量
    public int play;
}
*****************************************************************

package com.guoyun.view;

import com.guoyun.bean.MusicBean;

import java.util.Comparator;
import java.util.Iterator;
import java.util.Set;
import java.util.TreeSet;

/**
 * ClassName:
 * Function:  ADD FUNCTION
 * Reason:   ADD REASON
 *
 * @author
 * @Date
 * @since Ver 1.1
 */
public class MainView2 {
    public static void main(String[] args) {
        Set<MusicBean> set1=new TreeSet<MusicBean>(new MyCompareator());
        MusicBean mb1=new MusicBean();
        mb1.name="自由飞翔";
        mb1.play=444;
        MusicBean mb2=new MusicBean();
        mb2.name="荷塘月色";
        mb2.play=666;
        MusicBean mb3=new MusicBean();
        mb3.name="月亮之上";
        mb3.play=666;
        set1.add(mb1);
        set1.add(mb2);
        set1.add(mb3);
        for (Iterator<MusicBean> iterator = set1.iterator(); iterator.hasNext(); ) {
            MusicBean next =  iterator.next();
            System.out.println(next.name+" "+next.play);

        }
    }
}
class MyCompareator implements Comparator<MusicBean>{

    @Override
    public int compare(MusicBean o1, MusicBean o2) {
        //升序
        if(o1.play==o2.play){
        return o1.name.compareTo(o2.name);



        }else if(o1.play>o2.play){
            return 1;
        }else{
            return -1;
        }
//        if(o1.name.equals(o2.name)){
//            return 0;
//        }else{
//            return o1.play-o2.play;
//        }
    }
}

2020.02.23 Comparator接口

标签：tor   for   class   str   ring   view   pareto   play   else   

原文地址：https://www.cnblogs.com/aojie/p/12354466.html