java 中 Collections 的用法

  1. Collection和Collections的区别;
    Collections是个java.util下的类,它包含有各种有关集合操作的静态方法
    Collection是个java.util下的接口,它是各种集合结构的父接口
    List,Set继承自Collection接口,Map不是
  2. collections
    (1)sort 排序
double array[] = {112, 111, 23, 456, 231 };
for (int i = 0; i < array.length; i++) {
    list.add(new Double(array[i]));
}
Collections.sort(list);
for (int i = 0; i < array.length; i++) {
    System.out.println(li.get(i));
}
//结果:112,111,23,456,231

(2)shuffling 混排

Collections.Shuffling(list)
double array[] = {112, 111, 23, 456, 231 };
for (int i = 0; i < array.length; i++) {
    list.add(new Double(array[i]));
}
Collections.shuffle(list);
for (int i = 0; i < array.length; i++) {
    System.out.println(li.get(i));
}
//结果:112,111,23,456,231

(3)reverse 发转

Collections.reverse(list)
double array[] = {112, 111, 23, 456, 231 };
for (int i = 0; i < array.length; i++) {
    list.add(new Double(array[i]));
}
Collections. reverse (list);
for (int i = 0; i < array.length; i++) {
    System.out.println(li.get(i));
}
//结果:231,456,23,111,112

(4)fill 替换

String str[] = {"dd","aa","bb","cc","ee"};
for(int j=0; j<str.length; j++){
    li.add(new String(str[j]));
}
Collections.fill(li,"aaa");
for (int i = 0; i < li.size(); i++) {
    System.out.println(li.get(i));
}
//结果:aaa,aaa,aaa,aaa,aaa

(5)copy 拷贝

double array[] = {112, 111, 23, 456, 231 };
List list = new ArrayList();
List li = new ArrayList();
for (int i = 0; i < array.length; i++) {
    list.add(new Double(array[i]));
}
double arr[] = {1131,333};
for(int j=0; j<arr.length; j++){
    li.add(new Double(arr[j]));
}
Collections.copy(list,li);
for (int i = 0; i <list.size(); i++){
    System.out.println(list.get(i));
}
//结果:1131,333,23,456,231

(6)min 返回最小

Collections.min(list)
double array[] = {112, 111, 23, 456, 231 };
List list = new ArrayList();
for (int i = 0; i < array.length; i++) {
    list.add(new Double(array[i]));
}
Collections.min(list);
for (int i = 0; i<list.size(); i++){
    System.out.println("list[" + i + "]=" + list.get(i));
}
//结果:23

(7)max 返回最大

Collections.max(list)
double array[] = {112, 111, 23, 456, 231 };
List list = new ArrayList();
for (int i = 0; i < array.length; i++) {
    list.add(new Double(array[i]));
}
Collections.max(list);
for (int i = 0; i<list.size(); i++){
    System.out.println("list[" + i + "]=" + list.get(i));
}
//结果:456

(8)IndexOfSubList 第一次出现目标起始位置

int count = Collections.indexOfSubList(list,li);
double array[] = {112, 111, 23, 456, 231 };
List list = new ArrayList();
for (int i = 0; i < array.length; i++) {
    list.add(new Double(array[i]));
}
double arr[] = {111};
List li = new ArrayList();
for(int j=0; j<arr.length; j++) {
    li.add(new Double(arr[j]));
}
Int locations = Collections.indexOfSubList(list,li);
System.out.println(“===”+ locations);
//结果 1

(9)lastIndexOfSubList 从后往前第一次出现目标起始位置

int count = Collections.lastIndexOfSubList(list,li);
double array[] = {112, 111, 23, 456, 231 };
List list = new ArrayList();
for (int i = 0; i < array.length; i++) {
    list.add(new Double(array[i]));
}
double arr[] = {111};
List li = new ArrayList();
for(int j=0;j<arr.length;j++){
    li.add(new Double(arr[j]));
}
Int locations = Collections. lastIndexOfSubList (list,li);
System.out.println(“===”+ locations);
//结果 3

(10)Rotate 根据指定的距离循环移动指定列表中的元素

double array[] = {112, 111, 23, 456, 231 };
List list = new ArrayList();
for (int i = 0; i < array.length; i++) {
    list.add(new Double(array[i]));
}
Collections.rotate(list,-1);
for (int i = 0; i<list.size(); i++) {
    System.out.println(list.get(i));
}
//结果:111,23,456,231,112
  • 0
    点赞
  • 3
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值