备忘

public class Solution {
    public int GetNumberOfK(int [] array , int k) {
        if(k < array[0] || k > array[array.length-1]){
            return 0;
        }
        int left = 0;
        int right = array.length -1;
        int count = 0;
        while(left < right){
            int mid = (left+right)/2;
            if(array[mid] > k){
                right = mid;
            }else if(array[mid] < k){
                left = mid;
            }else{
                count++;
                int prev = mid-1;
                int foll = mid+1;
                while(prev >= 0){
                    if(array[prev] == k){
                        prev--;
                        count++;
                    }else{
                        break;
                    }
                }
                while(foll <= array.length-1){
                    if(array[foll] == k){
                        foll++;
                        count++;
                    }else{
                        break;
                    }
                }
            }
        }
        return count;
    }
}