public int searchR(String[] strings,String str,int first,int last){
if(first>last) return -1;
int mid=(first+last)/2;
if(strings[mid].isEmpty()){
int left=mid-1;
int right=mid+1;
while(true){
if(left<first&&right>last){
return -1;
}else if(right<=last&&!strings[right].isEmpty()){
mid=right;
break;
}else if(left>=first&&!strings[left].isEmpty()){
mid=left;
break;
}
right++;
left--;
}
}
if(str.equals(String[mid])){
return mid;
}else if(strings[mid].compareTo(str)<0){
return searchR(strings,str,mid+1,last);
}else {
return searchR(strings,str,first,mid-1);
}
}
public int search(String[] strings,string str){
if(strings==null||str==null||str==" "){
return -1;
}
return searchR(strings,str,0,strings.length-1);
}//有个排序后的字符串数组,其中散步着一些空字符串,找出给定字符串的位置
if(first>last) return -1;
int mid=(first+last)/2;
if(strings[mid].isEmpty()){
int left=mid-1;
int right=mid+1;
while(true){
if(left<first&&right>last){
return -1;
}else if(right<=last&&!strings[right].isEmpty()){
mid=right;
break;
}else if(left>=first&&!strings[left].isEmpty()){
mid=left;
break;
}
right++;
left--;
}
}
if(str.equals(String[mid])){
return mid;
}else if(strings[mid].compareTo(str)<0){
return searchR(strings,str,mid+1,last);
}else {
return searchR(strings,str,first,mid-1);
}
}
public int search(String[] strings,string str){
if(strings==null||str==null||str==" "){
return -1;
}
return searchR(strings,str,0,strings.length-1);
}//有个排序后的字符串数组,其中散步着一些空字符串,找出给定字符串的位置