数字在排序数组中出现的次数

题目：统计一个数字在排序数组中出现的次数。

思路：总体思想是二分查找和递归。把统计数字K的出现次数转换为查找第一个K和最后一个K。时间复杂度为O(logn)。

 public int GetNumberOfK(int [] array , int k) {
       if(array == null || array.length <= 0){
    		return 0;
    	}
    	int length = array.length;
    	int FirstK = getFirstK(array,length,k,0,length-1);
    	int LastK = getLastK(array,length,k,0,length-1);
    	if(FirstK > -1 && LastK > -1){
    		return LastK-FirstK+1;    		
    	}
    	return 0;
    }
    
    private static int getFirstK(int[] nums,int length,int k,int start,int end){
    	if(start>end){
    		return -1;
    	}
    	int middleIndex = start + (end-start)/2;
    	int middleData = nums[middleIndex];
    	if(middleData == k){
    		if((middleIndex>0&&nums[middleIndex-1]!=k)||middleIndex==0){
    			return middleIndex;
    		}
    		else{
    			end = middleIndex -1;
    		}
    	}
    	else if(middleData > k){
    		end = middleIndex -1;
    	}
    	else{
    		start = middleIndex + 1;
    	}
    	
    	return getFirstK(nums,length,k,start,end);
    }
    
    private static int getLastK(int[] nums,int length,int k,int start,int end){
    	if(start>end){
    		return -1;
    	}
    	int middleIndex = start + (end-start)/2;
    	int middleData = nums[middleIndex];
    	if(middleData == k){
    		if((middleIndex<end&&nums[middleIndex+1]!=k)||middleIndex==end){
    			return middleIndex;
    		}
    		else{
    			start = middleIndex + 1;
    		}
    	}
    	else if(middleData>k){
			end = middleIndex - 1;
		}
		else{
			start = middleIndex + 1;
		}
    	return getLastK(nums,length,k,start,end);
    }