import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.List;
import java.util.TreeSet;
public class CollectionsDemo {
public static void main(String[] args) {
/*
* Collections: 是集合框架的工具类
* 里面的方法都是静态的。
*
*/
// demo_1();
Integer i = 12;
Integer j = 12;
Integer k =200;
Integer q = 200;
System.out.println(i==j);
System.out.println(k==q);
demo_3();
}
public static void demo_3() {
// TODO Auto-generated method stub
//倒序输出
Comparator com =Collections.reverseOrder(); //返回一个比较器,它强行逆转实现了 Comparble接口对象collection的自然排序
//TreeSet是自动排序的
TreeSet<String> treeSet = new TreeSet<String>(com);
treeSet.add("ads");
treeSet.add("dsga");
treeSet.add("sdfgs");
treeSet.add("afsf");
treeSet.add("adas");
System.out.println(treeSet);
}
public static void demo_1(){
List<String> list = new ArrayList<String>();//为了查找速度快一些。
list.add("asdf");
list.add("sdfa");
list.add("qwqw");
list.add("aas");
list.add("aas");
list.add("sgs");
System.out.println(list);
//对list集合进行排序
// Collections.sort(list);
mySort(list);
System.out.println("排序后的list:" +list);
//把排序好的元素随机化
Collections.shuffle(list);
//折半查找
int index = Collections.binarySearch(list, "qwqw");
System.out.println(index);
//获取最大值
String max = Collections.max(list);
System.out.println("max="+max);
}
public static <T extends Comparable<? super T>> void mySort(List<T> list){
for (int i = 0; i <list.size()-1; i++) {
for (int j = i+1; j < list.size(); j++) {
if (list.get(i).compareTo(list.get(j))>0) {
// T temp = list.get(i);
// list.set(i, list.get(j));
// list.set(j, temp);
Collections.swap(list, i, j);
}
}
}
}
}