Comparator如何通过姓名的长度进行排序

package junit;

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

import org.junit.jupiter.api.Test;

class TreeSetTest {

 @Test  void test() {      Set set = new TreeSet(new ComparatorByName());   set.add("set");   set.add("java");   set.add("linked");   set.add("map");   set.add("list");   for (Iterator iterator = set.iterator(); iterator.hasNext();) {    Object object = (Object) iterator.next();    System.out.println(object);   }  }

}

class ComparatorByName implements Comparator {

 @Override  public int compare(Object o1, Object o2) {   // TODO Auto-generated method stub   String s1 = (String)o1;   String s2 = (String)o2;   int temp = s1.length()-s2.length();   return temp==0?s1.compareTo(s2):temp;  }   }