问题说明:
1.给定一个有序(不降序)数组arr,求最大的索引i使得arr[i]小于v,不存在则返回-1;
2.充分利用数组有序的信息,利用二分查找思想;
2.题目要求是严格小于,考虑问题依然是全集观念,两者大小关系分为三种都要考虑清楚。
public static int getLastIndexStrictLessThan(int[] sorted, int keyValue){
int len = 0;
if(null == sorted || (len = sorted.length) == 0){
throw new IllegalArgumentException();
}
return getLastIndexStrictLessThan(sorted, 0, len - 1, keyValue);
}
public static int getLastIndexStrictLessThan(int[] sorted, int fromIndex, int toIndex, int keyValue){
if(null == sorted){
throw new IllegalArgumentException();
}
if(fromIndex > toIndex){
throw new IndexOutOfBoundsException();
}
// fromIndex <= toIndex
boolean isNotExist = (sorted[fromIndex] >= keyValue);
if(isNotExist){
return -1;
}
boolean isExistAndMax = (sorted[toIndex] < keyValue);
if(isExistAndMax){
return toIndex;
}
// sorted[toIndex]>=keyValue && sorted[fromIndex] < keyValue
// sorted[toIndex] != sorted[fromIndex]
// index >= fromIndex && index < toIndex
int index = toIndex;// first sorted[index] < keyValue
while((index >= fromIndex) && (sorted[index] >= keyValue)){
index --;
}
//asert index exist at least equal fromIndex
return index;
}