增加、排序操作
- 常用方法有
import java.util.ArrayList;
import java.util.Collections;
public class CollectionTest01 {
public static void main(String[] args) {
ArrayList<Integer>list = new ArrayList<>();
//添加元素
Collections.addAll(list,4,56,2,7,3,45,56);
System.out.println("排序前:"+list);
Collections.reverse(list);//反转
System.out.println("反转后:"+list);
Collections.sort(list);//自然排序
System.out.println("自然排序后:"+list);
Collections.shuffle(list);
System.out.println("随机排序后:"+list);
Collections.swap(list,0,list.size()-1);
System.out.println("首尾元素交换后:"+list);
}
}
查找、替换操作
- 常用方法有
import java.util.ArrayList;
import java.util.Collections;
public class CollectionTest {
public static void main(String[] args) {
ArrayList<Integer>list = new ArrayList<>();.
//添加元素
Collections.addAll(list,3,5,7,6,7,2,9,3,567,6,43,4,2,3,2);
System.out.println("集合中的元素:"+list);
System.out.println("最大元素:"+Collections.max(list));
System.out.println("最小元素:"+Collections.min(list));
//将集合中的3用1替换掉
Collections.replaceAll(list,3,1);
//排序
Collections.sort(list);
//通过二分法查找元素43所在的角标,在使用二分法查找前,保证元素有序
int index = Collections.binarySearch(list,9);
System.out.println(index);
}
}