package jihe;
import java.util.Comparator;
import java.util.Iterator;
import java.util.TreeSet;
class Stri
{
void stri()
{
TreeSet<String> st=new TreeSet<String>(new Compare3());
st.add("abc");
st.add("aaa");
st.add("a");
st.add("sfasf");
st.add("dsfsfsdfgs");
Iterator<String> it=st.iterator();
while(it.hasNext())
{
Sop.sop(it.next());
}
}
}
class Compare3 implements Comparator<String>
{
public int compare(String o1,String o2)
{
int num=new Integer(o1.length()).compareTo(new Integer(o2.length()));
if(num==0)
{
return o1.compareTo(o2);
}
return num;
}
}
public class FanXingDemo1 {
public static void main(String [] args)
{
new Stri().stri();;
}
}