Download Set_advanced_project/Set_module/src/TreeSet_package2/TreeSet_demo4.java from zxy0307/Java: direct link, hf CLI and curl.
- Browser
- Download file 1.03 kB
-
https://huggingface.co/zxy0307/Java/resolve/main/Set_advanced_project/Set_module/src/TreeSet_package2/TreeSet_demo4.java
- Command line
-
hf download hf://zxy0307/Java/Set_advanced_project/Set_module/src/TreeSet_package2/TreeSet_demo4.java
-
curl -L -o TreeSet_demo4.java https://huggingface.co/zxy0307/Java/resolve/main/Set_advanced_project/Set_module/src/TreeSet_package2/TreeSet_demo4.java
1.03 kB
| package TreeSet_package2; | |
| import java.util.Comparator; | |
| import java.util.TreeSet; | |
| public class TreeSet_demo4 { | |
| public static void main(String[] args) { | |
| /* | |
| 需求:请自行选择比较器排序和自然排序两种方式; | |
| 要求:存入四个字符串,"c","ab","df","qwer" | |
| 按照长度排序,如果一样长则按照首字母排序 | |
| 采取第二种 | |
| */ | |
| //1、创建集合 | |
| TreeSet<String> ts = new TreeSet<>(new Comparator<String>() { | |
| public int compare(String o1, String o2) { | |
| //按照长度排序 | |
| int i = o1.length() - o2.length(); | |
| //如果一样长则按照首字母排序 | |
| i = i == 0 ? o1.compareTo(o2) : i; | |
| return i; | |
| } | |
| }); | |
| //2、添加元素 | |
| ts.add("c"); | |
| ts.add("ab"); | |
| ts.add("df"); | |
| ts.add("qwer"); | |
| //3、打印集合 | |
| System.out.println(ts); | |
| } | |
| } | |