(1)一个人只要自己不放弃自己,整个世界也不会放弃你.
(2)天生我才必有大用
(3)不能忍受学习之苦就一定要忍受生活之苦,这是多么痛苦而深刻的领悟.
(4)做难事必有所得
(5)精神乃真正的刀锋
(6)战胜对手有两次,第一次在内心中.
(7)编写实属不易,若喜欢或者对你有帮助记得点赞+关注或者收藏哦~
Java SE 047 实现自己的Comparator及Collections详解
文章目录
1.实现自己的Comparator
1.1例1:对于字符的比较
package com.javase.treeset;
import java.util.Comparator;
import java.util.Iterator;
import java.util.TreeSet;
public class TreeSetTest3 {
@SuppressWarnings("unchecked")
public static void main(String[] args) {
TreeSet set = new TreeSet(new MyComparator());
set.add("C");
set.add("F");
set.add("A");
set.add("D");
set.add("E");
set.add("B");
for(Iterator iter = set.iterator(); iter.hasNext();){
String value = (String)iter.next();
System.out.println(value);
}
}
}
@SuppressWarnings("unchecked")
class MyComparator implements Comparator{
//如果这个方法返回一个-1代表o1比o2小,对于字符串儿来说就是o1在o2的前面。
//如果等于0,则o1与o2是相等的。
//如果>0是正数,则o1>o2
//实际上是按照升序的方式去考虑的。
//现在需要实现字符串儿的降序排序可用s2.compareTo(s1);
@Override
public int compare(Object o1, Object o2) {
//强制转换成放进集合中元素的类型
String s1 = (String)o1;
String s2 = (String)o2;
return s2.compareTo(s1);
}
}
package com.javareview.collections;
import java.util.Comparator;
import java.util.Iterator;
import java.util.TreeSet;
public class TreeSetTest {
public static void main(String[] args) {
TreeSet<String> set = new TreeSet<String>(new MyComparator());
set.add("C");
set.add("F");
set.add("A");
set.add("D");
set.add("E");
set.add("B");
for(Iterator<String> iter = set.iterator(); iter.hasNext();){
String value = (String)iter.next();
System.out.println(value);
}
}
}
class MyComparator implements Comparator<String>{
@Override
public int compare(String o1, String o2) {
return o1.compareTo(o2);
}
}
1.2例2:对于整数的比较
package com.javase.treeset;
import java.util.Comparator;
import java.util.Iterator;
import java.util.TreeSet;
public class TreeSetTest2 {
@SuppressWarnings("unchecked")
public static void main(String[] args) {
TreeSet set = new TreeSet(new MyComparator2());
Person p1 = new Person(10);
Person p2 = new Person(20);
Person p3 = new Person(30);
Person p4 = new Person(40);
Person p5 = new Person(50);
set.add(p1);
set.add(p2);
set.add(p3);
set.add(p4);
set.add(p5);
for(Iterator iter = set.iterator(); iter.hasNext();){
System.out.println(((Person)iter.next()).score);
}
}
}
class Person{
int score;
public Person(int score){
this.score = score;
}
@Override
public String toString() {
return String.valueOf(score);
}
}
@SuppressWarnings("unchecked")
class MyComparator2 implements Comparator{
//比较器接收的参数Object o1与o2是由放进集合中的元素来决定的,此例中放进集合中的元素是Person,则在进行比较时需要将传进集合中的Object强制转换成Person之后然后再进行比较。
@Override
public int compare(Object o1, Object o2) {
Person p1 = (Person) o1;
Person p2 = (Person) o2;
return p1.score - p2.score;
}
}
2.集合的辅助功能类 Collections
2.1例1:集合元素倒序排序
package com.javase.collections;
import java.util.Collections;
import java.util.Comparator;
import java.util.Iterator;
import java.util.LinkedList;
public class CollectionsTest {
@SuppressWarnings("unchecked")
public static void main(String[] args) {
LinkedList li = new LinkedList();
li.add(new Integer(-10));
li.add(new Integer(15));
li.add(new Integer(12));
li.add(new Integer(-5));
Comparator comparator = Collections.reverseOrder();
//第一个参数是要排序的集合,第二个参数是排序规则
Collections.sort(li,comparator);
for(Iterator iter = li.iterator();iter.hasNext();){
System.out.println((Integer)iter.next());
}
}
}
2.2例2:将集合打乱顺序(shuffle(List list))
package com.javase.collections;
import java.util.Collections;
import java.util.Comparator;
import java.util.Iterator;
import java.util.LinkedList;
public class CollectionsTest {
@SuppressWarnings("unchecked")
public static void main(String[] args) {
LinkedList li = new LinkedList();
li.add(new Integer(-10));
li.add(new Integer(15));
li.add(new Integer(12));
li.add(new Integer(-5));
Comparator comparator = Collections.reverseOrder();
//第一个参数是要排序的集合,第二个参数是排序规则
Collections.sort(li,comparator);
for(Iterator iter = li.iterator();iter.hasNext();){
System.out.println((Integer)iter.next());
}
System.out.println();
//将集合顺序打乱
Collections.shuffle(li);
for(Iterator iter = li.iterator();iter.hasNext();){
System.out.println((Integer)iter.next());
}
}
}
2.3例3:获取集合中的最大值与最小值
package com.javase.collections;
import java.util.Collections;
import java.util.Comparator;
import java.util.Iterator;
import java.util.LinkedList;
public class CollectionsTest {
@SuppressWarnings("unchecked")
public static void main(String[] args) {
LinkedList li = new LinkedList();
li.add(new Integer(-10));
li.add(new Integer(15));
li.add(new Integer(12));
li.add(new Integer(-5));
Comparator comparator = Collections.reverseOrder();
//第一个参数是要排序的集合,第二个参数是排序规则
Collections.sort(li,comparator);
for(Iterator iter = li.iterator();iter.hasNext();){
System.out.println((Integer)iter.next());
}
System.out.println();
//将集合顺序打乱
Collections.shuffle(li);
for(Iterator iter = li.iterator();iter.hasNext();){
System.out.println((Integer)iter.next());
}
System.out.println();
System.out.println("min value:"+Collections.min(li));
System.out.println("max value:"+Collections.max(li));
}
}