二分查找法
import java.util.ArrayList;
import java.util.List;
public class BinarySearch {
public static void main(String[] args) {
int[] arr = {1,3,4,6,6,6,6,6,6,6,7,9,19};
List<Integer> binarySearch2 = binarySearch2(arr,0,arr.length-1,6);
System.out.println(binarySearch2);
}
public static int binarySearch(int[] arr,int left, int right,int findValue){
if(left > right){
return -1;
}
int mid = (left + right) /2;
int midValue = arr[mid];
if(findValue < midValue){
return binarySearch(arr,left,mid-1,findValue);
}else if(findValue > midValue){
return binarySearch(arr,mid+1,right,findValue);
}else{
return mid;
}
}
public static List<Integer> binarySearch2(int[] arr,int left, int right,int findValue){
if(left > right){
return new ArrayList<Integer>();
}
int mid = (left + right) /2;
int midValue = arr[mid];
if(findValue < midValue){
return binarySearch2(arr,left,mid-1,findValue);
}else if(findValue > midValue){
return binarySearch2(arr,mid+1,right,findValue);
}else{
List<Integer> list = new ArrayList<>();
int temp = mid - 1;
while(true){
if(temp < 0 || arr[temp] != findValue){
break;
}
list.add(temp);
temp --;
}
list.add(mid);
temp = mid + 1;
while(true){
if(temp > arr.length-1 || arr[temp] != findValue){
break;
}
list.add(temp);
temp ++;
}
return list;
}
}
}