学习之路---java设计模式--策略模式

package org.example.ms.cl;

/**
 * @author Gavin.luo
 * @title: Comparator
 * @projectName MyData
 * @description:
 * @date 2022/3/7 9:25
 */
public interface Comparator<T> {

    int compareTo(T o1,T o2);
}

package org.example.ms.cl;

/**
 * @author Gavin.luo
 * @title: Cat
 * @projectName MyData
 * @description:
 * @date 2022/3/5 15:28
 */
public class Cat  implements Comparable<Cat>{
    int weight,height;
    public Cat(int weight,int height){
        this.weight = weight;
        this.height = height;
    }


    @Override
    public String toString() {
        return "Cat{" +
                "weight=" + weight +
                ", height=" + height +
                '}';
    }


}

package org.example.ms.cl;

/**
 * @author Gavin.luo
 * @title: CatWeightComparator
 * @projectName MyData
 * @description:
 * @date 2022/3/8 16:03
 */
public class CatHeightComparator implements Comparator<Cat> {

    @Override
    public int compareTo(Cat o1, Cat o2) {
        if(o1.height<o2.height) return -1;
        else if(o1.height>o2.height) return 1;
        else return 0;
    }
}

package org.example.ms.cl;

/**
 * @author Gavin.luo
 * @title: CatWeightComparator
 * @projectName MyData
 * @description:
 * @date 2022/3/8 16:03
 */
public class CatWeightComparator implements Comparator<Cat> {

    @Override
    public int compareTo(Cat o1, Cat o2) {
        if(o1.weight<o2.weight) return -1;
        else if(o1.weight>o2.weight) return 1;
        else return 0;
    }
}

package org.example.ms.cl;

/**
 * @author Gavin.luo
 * @title: Sortor
 * @projectName MyData
 * @description:
 * @date 2022/3/7 9:27
 */
public class Sortor<T> {

    public void sortCat(T[] arr,Comparator<T> comparator){
        //冒泡排序 升序
        for (int i=0;i<arr.length -1;i++){
            int minPos = i;
            for(int j=i+1;j < arr.length;j++){
                minPos = comparator.compareTo(arr[j],arr[minPos]) == -1?j:minPos;
            }
            swapCat(arr,i,minPos);
        }
    }

     void swapCat(T[] arr,int i,int j){
        T temp = arr[i];
        arr[i] = arr[j];
        arr[j] = temp;
    }
}

package org.example.ms.cl;

import java.util.Arrays;

/**
 * @author Gavin.luo
 * @title: TestComparator
 * @projectName MyData
 * @description:
 * @date 2022/3/7 9:34
 */
public class TestComparator {
    public static void main(String[] args) {

        Cat[] cats = {new Cat(3,5),new Cat(1,6),new Cat(2,3)};
        Sortor<Cat> catSortor=new Sortor<>();
        catSortor.sortCat(cats,new CatWeightComparator());
        System.out.println(Arrays.toString(cats));

        catSortor.sortCat(cats,new CatHeightComparator());
        System.out.println(Arrays.toString(cats));

    }
}

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

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值