62,614
社区成员
发帖
与我相关
我的任务
分享
TreeSet<Integer> treeset = new TreeSet<Integer>(new Comparator<Integer>(){
public int compare(Integer i, Integer j) {
System.out.println("i="+i+",j="+j);
return j-i;
}
});
for(int i=0;i<6;i++){
treeset.add(i);
}
Queue<Integer> queue = new PriorityQueue<Integer>(6,new Comparator<Integer>(){
public int compare(Integer i, Integer j) {
//System.out.println("i="+i+",j = "+j);
int result = i%2-j%2;
if(0==result){
System.out.println("i="+i+",j = "+j+",result="+(i-j));
return i-j;
}
System.out.println("i="+i+",j = "+j+",result="+result);
return result;
}
});
for(int i=0;i<6;i++){
queue.offer(i);
}