package 数字在排序数组中出现的次数;
/*题目:统计一个数字在排序数组中出现的次数。例如输入排序数组{1,2,3,3,3,
3,3,4,5}和数字 3,由于 3 在这个数组中出现了 4 次,因此输出 4。
* 1 2 3 3 3 3 4 5
*
*
*
*
*/
public class Problem38 {
public static void main(String[] args) {
int[] array={1,2,3,3,3,3,4,5};
Problem38 problem38=new Problem38();
System.out.println(problem38.printNumberOfK(array,3));
}
public Integer printNumberOfK(int[] array,int n){
int number=0;
int start=getStartOfK(array,n,0,array.length-1);
int end=getEndOfK(array,n,0,array.length-1);
if((start>-1)&&(end>-1)){
number=end-start+1;
}
return number;
}
public Integer getStartOfK(int[] array,int k,int first,int last){
int mid=(first+last)>>1;
if(first>last){
return -1;
}
int arrayDate=array[mid];
if(arrayDate==k){
if((mid>0&&array[mid-1]!=k)||mid==0){
return mid;
}else{
last=mid-1;
}
}else if(arrayDate>k){
last=mid-1;
}else{
first=mid+1;
}
return getStartOfK(array,k,first,last);
}
public Integer getEndOfK(int[] array,int k,int first,int last){
int mid=(first+last)>>1;
if(first>last){
return -1;
}
int arrayDate=array[mid];
if(arrayDate==k){
if((mid>0&&array[mid+1]!=k)||mid==0){
return mid;
}else{
first=mid+1;
}
}else if(arrayDate>k){
first=mid-1;
}else{
last=mid+1;
}
return getEndOfK(array,k,first,last);
}
}
/*题目:统计一个数字在排序数组中出现的次数。例如输入排序数组{1,2,3,3,3,
3,3,4,5}和数字 3,由于 3 在这个数组中出现了 4 次,因此输出 4。
* 1 2 3 3 3 3 4 5
*
*
*
*
*/
public class Problem38 {
public static void main(String[] args) {
int[] array={1,2,3,3,3,3,4,5};
Problem38 problem38=new Problem38();
System.out.println(problem38.printNumberOfK(array,3));
}
public Integer printNumberOfK(int[] array,int n){
int number=0;
int start=getStartOfK(array,n,0,array.length-1);
int end=getEndOfK(array,n,0,array.length-1);
if((start>-1)&&(end>-1)){
number=end-start+1;
}
return number;
}
public Integer getStartOfK(int[] array,int k,int first,int last){
int mid=(first+last)>>1;
if(first>last){
return -1;
}
int arrayDate=array[mid];
if(arrayDate==k){
if((mid>0&&array[mid-1]!=k)||mid==0){
return mid;
}else{
last=mid-1;
}
}else if(arrayDate>k){
last=mid-1;
}else{
first=mid+1;
}
return getStartOfK(array,k,first,last);
}
public Integer getEndOfK(int[] array,int k,int first,int last){
int mid=(first+last)>>1;
if(first>last){
return -1;
}
int arrayDate=array[mid];
if(arrayDate==k){
if((mid>0&&array[mid+1]!=k)||mid==0){
return mid;
}else{
first=mid+1;
}
}else if(arrayDate>k){
first=mid-1;
}else{
last=mid+1;
}
return getEndOfK(array,k,first,last);
}
}