Collections.binarySearch的两个用法

最新推荐文章于 2022-05-22 08:30:00 发布

weixin_34126557

最新推荐文章于 2022-05-22 08:30:00 发布

阅读量245

点赞数

文章标签： java python

原文链接：https://my.oschina.net/u/1052192/blog/688578

版权

2019独角兽企业重金招聘Python工程师标准>>>

public class Student implements Comparable<Student>{ private String id; private String name; private int age;

public Student(String id,String name,int age){
    this.id = id;
    this.name = name;
    this.age = age;
}

public boolean equals(Object obj){
    if(obj == null){
        return false;
    }
    
    if(this == obj){
        return true;
    }
    
    if(obj.getClass() != this.getClass()){
        return false;
    }
    
    Student student = (Student)obj;
    if(!student.getName().equals(getName())){
        return false;
    }
    
    return true;
}

public int compareTo(Student student) {
    return this.age - student.age;
}

/** 省略getter、setter方法 */

}

public static void main(String[] args){ List<Student> list = new ArrayList<>(); list.add(new Student("1", "chenssy1", 24)); list.add(new Student("2", "chenssy1", 26));

    Collections.sort(list);   //排序
    
    Student student = new Student("2", "chenssy1", 26);
    
    //检索student在list中的位置
    int index1 = list.indexOf(student);
    int index2 = Collections.binarySearch(list, student);
    
    System.out.println("index1 = " + index1);
    System.out.println("index2 = " + index2);
}

http://cmsblogs.com/?p=1242这篇有提供这个方法实例

在student实体实现了排序还有一种排序完在实现,不排序,还不能找到正确的序号,很神奇!

package list;

import java.util.ArrayList; import java.util.Collections; import java.util.Comparator; import java.util.List;

import org.apache.commons.lang3.math.NumberUtils;

import com.google.common.collect.Lists;

public class IndexList {

@SuppressWarnings({ "unchecked", "rawtypes" })
public static void main(String[] args) {
	List list = Lists.newArrayList();
	list.add(2);
	list.add(3);
	list.add(4);
	list.add(3);
	list.add(0);
	// Arrays.binarySearch(arg0, arg1)
	Comparator c = new Comparator(){
		@Override
		public int compare(Object o1, Object o2) {
			return NumberUtils.toInt(o1.toString())-NumberUtils.toInt(o2.toString());
		}
	};
	Collections.sort(list, c);
	int indexFirst = Collections.binarySearch(list, 0, null);
	System.out.println("indexFirst" + indexFirst);
	// create arraylist
	ArrayList<String> arlst = new ArrayList<String>();

	// populate the list
	arlst.add("TP");
	arlst.add("PROVIDES");
	arlst.add("QUALITY");
	arlst.add("TUTORIALS");

	// search the list for key 'QUALITY'
	int index = Collections.binarySearch(arlst, "QUALITY");

	System.out.println("'QUALITY' is available at index: " + index);

}

}

转载于:https://my.oschina.net/u/1052192/blog/688578