Collections工具类和Arrays工具常见方法

Collections(集合的常用方法)

1.排序操作
void reverse(List list) 反转
void shffle(List list) 随机排序
void sort(List list)按自然顺序升序排序
void sort(List list,Comparator c)定制排序，由Comparator控制排序逻辑
void swap(List list,int j,int i) 交换2个索引的位置
void rotate(List list,int distance)旋转。当distance为正数时，将list后distance个元素整体移到前面。当distance为负数时，将list前distance个元素整体移到前面。

   ArrayList<Integer> arrayList = new ArrayList<>();
            arrayList.add(-1);
            arrayList.add(2);
            arrayList.add(0);
            arrayList.add(1);
            arrayList.add(-2);
            System.out.println("原始数组");
            System.out.println(arrayList);
            Collections.reverse(arrayList);
            System.out.println("反转后的数组");
            System.out.println(arrayList);
            Collections.sort(arrayList);
            System.out.println("自然排序后的数组");
            System.out.println(arrayList);
            Collections.shuffle(arrayList);
            System.out.println("随机排序后的数组");
            System.out.println(arrayList);
            Collections.swap(arrayList,1,2);
            System.out.println("交换1 2位置的数组");
            System.out.println(arrayList);
            Collections.sort(arrayList, new Comparator<Integer>() {
                @Override
                public int compare(Integer o1, Integer o2) {
                    return o2.compareTo(o1);
                }
            });
            System.out.println("定制排序后的数组");
            System.out.println(arrayList);

2.查找，替换操作
int binarySearch(List list, Object key)//对List进行二分查找，返回索引，注意List必须是有序的
int max(Collection coll)//根据元素的自然顺序，返回最大的元素。 类比int min(Collection coll)
int max(Collection coll, Comparator c)//根据定制排序，返回最大元素，排序规则由Comparatator类控制。类比int min(Collection coll, Comparator c)
void fill(List list, Object obj)//用指定的元素代替指定list中的所有元素。
int frequency(Collection c, Object o)//统计元素出现次数
int indexOfSubList(List list, List target)//统计target在list中第一次出现的索引，找不到则返回-1，类比int lastIndexOfSubList(List source, list target).
boolean replaceAll(List list, Object oldVal, Object newVal), 用新元素替换旧元素

ArrayList arrayList = new ArrayList();
arrayList.add(-1);
arrayList.add(3);
arrayList.add(3);
arrayList.add(-5);
arrayList.add(7);
arrayList.add(4);
arrayList.add(-9);
arrayList.add(-7);
ArrayList arrayList2 = new ArrayList();
arrayList2.add(-3);
arrayList2.add(-5);
arrayList2.add(7);
System.out.println(“原始数组:”);
System.out.println(arrayList);

	System.out.println("Collections.max(arrayList):");
	System.out.println(Collections.max(arrayList));

	System.out.println("Collections.min(arrayList):");
	System.out.println(Collections.min(arrayList));

	System.out.println("Collections.replaceAll(arrayList, 3, -3):");
	Collections.replaceAll(arrayList, 3, -3);
	System.out.println(arrayList);

	System.out.println("Collections.frequency(arrayList, -3):");
	System.out.println(Collections.frequency(arrayList, -3));

	System.out.println("Collections.indexOfSubList(arrayList, arrayList2):");
	System.out.println(Collections.indexOfSubList(arrayList, arrayList2));

	System.out.println("Collections.binarySearch(arrayList, 7):");
	// 对List进行二分查找，返回索引，List必须是有序的
	Collections.sort(arrayList);
	System.out.println(Collections.binarySearch(arrayList, 7));