目录
1.public static int binarySearch(List> list, T key)
2.public static int binarySearch(List list, T key, Comparator c)
1.public static > void sort(List list)
2.public static void sort(List list, Comparator c)
1.public static void shuffle(List list)
2.public static void shuffle(List list, Random rnd)
1.public static void reverse(List list)直接反转集合的元素
2.public static Comparator reverseOrder();返回可以使集合反转的比较器Comparator
使用前添加注解@slf4j
1. addAll
public static <T> boolean addAll(Collection<? super T> c, T… elements):向指定的集合c中加入特定的一些元素elements。
public static void main(String args[]){
List<String> list = new ArrayList<>();
list.add("s2");
list.add("s4");
list.add("s1");
list.add("s3");
System.out.println(list);
Collections.addAll(list, "s5","s7",null,"s9");
System.out.println(list);
}
2.binarySearch
1.public static <T> int binarySearch(List<? extends Comparable<? super T>> list, T key)
List<String> list = new ArrayList<>();
list.add("s2");
list.add("s4");
list.add("s1");
list.add("s3");
Collections.addAll(list, "s5","s7",null,"s9");
System.out.println(list);
System.out.println(Collections.binarySearch(list,"s5"));
2.public static <T> int binarySearch(List<? extends T> list, T key, Comparator<? super T> c)
利用二分法在指定的集合中查找元素
3.sort
1.public static <T extends Comparable<? super T>> void sort(List<T> list)
需要泛型T类本身支持Comparable接口
2.public static <T> void sort(List<T> list, Comparator<? super T> c)
4.shuffle
1.public static void shuffle(List<?> list)
List<String> list = new ArrayList<>();
list.add("s1");
list.add("s2");
list.add("s3");
list.add("s4");
Collections.shuffle(list);
System.out.println(list);
2.public static void shuffle(List<?> list, Random rnd)
混排。混排算法所做的正好与sort相反:它打乱在一个List中可能有的任何排列的踪迹。也就是说,基于随机源的输入重排list,这样的排列具有相同的可能性(假设随机源是公正的)。
5. reverse
有关反转主要有这三个方法:
1.public static void reverse(List<?> list)
直接反转集合的元素
List<String> list = new ArrayList<>();
list.add("s1");
list.add("s2");
list.add("s3");
list.add("s4");
System.out.println(list);
Collections.reverse(list);
System.out.println(list);
2.public static <T> Comparator<T> reverseOrder();
返回可以使集合反转的比较器Comparator
List<String> list = new ArrayList<>();
list.add("s1");
list.add("s2");
list.add("s3");
System.out.println(list);
Comparator<String> comp = Collections.reverseOrder();
Collections.sort(list,comp);
System.out.println(list);
3.public static <T> Comparator<T> reverseOrder(Comparator<T> cmp);
如果cmp不为null,返回cmp的反转的比较器,即集合的反转的反转,最后就是没反转。如果cmp为null,效果等同于第二个方法.
List<String> list = new ArrayList<>();
list.add("s1");
list.add("s2");
list.add("s3");
list.add("s4");
System.out.println(list);
Comparator<String> comp = Collections.reverseOrder();
Collections.sort(list,comp);
System.out.println(list);
Comparator<String> comp2 = Collections.reverseOrder(comp);
Collections.sort(list,comp2);
System.out.println(list);