comparator的原意是按照字母的先后顺序进行比较
而我们改写的目的是想按照字母的长短进行排序
1、重写comparator方法
①定义数组
②使用多态,父类new 子类对象
package com.wyq.study;
import java.util.Comparator;
public class reComparator implements Comparator{
String array [] = new String []{};
@Override
public int compare(Object o1, Object o2) {
String s1 = (String)o1;
String s2 = (String)o2;
//第一种写法
// return s1.length() - s2.length();
//第二种写法
if(s1.length()>s2.length()){
return 1;
}else if(s1.length()<s2.length()){
return -1;
}
return 0;
}
}
2、测试
package com.wyq.study;
import java.util.Arrays;
import java.util.Comparator;
public class TestNoName {
public static void main(String[] args) {
String [] str= new String []{"tomatos","pink","apple","banana","orange","peach"};
//使用原来的方法进行比较
Arr