9. Collections算法
sort
shuffle
binarySearch
fill
max
min
reverse
swap
實例:
package com.geek99.demo;
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
public class Test {
static List<Integer> list = new ArrayList<Integer>();
public static void main(String[] args) {
list.add(4);
list.add(1);
list.add(2);
list.add(5);
list.add(3);
list.add(6);
list.add(8);
list.add(7);
list.add(9);
System.out.println(list);
// 排序
Collections.sort(list);
System.out.println("-----------------------");
System.out.println(list);
// 洗牌
//Collections.shuffle(list);
System.out.println("-----------------------");
System.out.println(list);
// 二分查找
Collections.sort(list);
int index = Collections.binarySearch(list, 3);
System.out.println(index);
int max = Collections.max(list);
int min = Collections.min(list);
System.out.println("max="+max);
System.out.println("min="+min);
// Collections.reverse(list);
System.out.println(list);
Collections.swap(list, 2, 4);
System.out.println("-----------------------");
System.out.println(list);
}
}
該博客教程視頻地址:http://geek99.com/node/1649