数字在排序数组中出现的次数（java版）

【题目描述】统计一个数字在排序数组中出现的次数。

---

【解题思路1】
//1. 直接解，遍历一次数组，累计出现次数。

【源码1】

public class Solution {
    public int GetNumberOfK(int [] array , int k) {
        int num = 0;
        for(int a: array){
            if(a == k){
                num++;
            }
        }
        return num;
    }
}

---

【解题思路2】
//1. 二分法查找。
//2. 将最后出现的位置和第一次出现的位置求差值，即出现的次数。
//3. 适用于已经排好序的数组，特别是在数据量比较大的时候。复杂度为o(log2N)。以2为底，n的对数。

【源码2a】

链接：https://www.nowcoder.com/questionTerminal/70610bf967994b22bb1c26f9ae901fa2
来源：牛客网

public class Solution {
    public int GetNumberOfK(int [] array , int k) {
        int length = array.length;
        if(length == 0){
            return 0;
        }
        int firstK = getFirstK(array, k, 0, length-1);
        int lastK = getLastK(array, k, 0, length-1);
        if(firstK != -1 && lastK != -1){
             return lastK - firstK + 1;
        }
        return 0;
    }
    //递归写法
    private int getFirstK(int [] array , int k, int start, int end){
        if(start > end){
            return -1;
        }
        int mid = (start + end) >> 1;
        if(array[mid] > k){
            return getFirstK(array, k, start, mid-1);
        }else if (array[mid] < k){
            return getFirstK(array, k, mid+1, end);
        }else if(mid-1 >=0 && array[mid-1] == k){
            return getFirstK(array, k, start, mid-1);
        }else{
            return mid;
        }
    }
    //循环写法
    private int getLastK(int [] array , int k, int start, int end){
        int length = array.length;
        int mid = (start + end) >> 1;
        while(start <= end){
            if(array[mid] > k){
                end = mid-1;
            }else if(array[mid] < k){
                start = mid+1;
            }else if(mid+1 < length && array[mid+1] == k){
                start = mid+1;
            }else{
                return mid;
            }
            mid = (start + end) >> 1;
        }
        return -1;
    }
}

【源码2b】

链接：https://www.nowcoder.com/questionTerminal/70610bf967994b22bb1c26f9ae901fa2
来源：牛客网

public class Solution {
    public  int GetNumberOfK(int [] array , int k) {
        int length = array.length;
        if(length <=0 || array == null){
            return 0;
        }
        int num = array[length/2];
        int[] arrayLeft;
        int[] arrayRight;
        int count = 0;
        if(num > k){
            arrayLeft = Arrays.copyOfRange(array, 0, length/2);
            count = GetNumberOfK(arrayLeft, k);
        }
        if(num < k){
            arrayRight = Arrays.copyOfRange(array, length/2+1, length);
            count = GetNumberOfK(arrayRight, k);
        }
        if(num == k){
            count++;
            int leftCount = 0;
            int rightCount = 0;
            int leftNum;
            int rightNum;
            for(int i = 1; i <= length/2; i++){
                leftNum = array[length/2-i];
                if(leftNum==k){
                    leftCount++;
                }else{              
                    break;
                }
            }
            count += leftCount;
            for(int i = 1; i <= length/2-1;i++){
                rightNum = array[length/2+i];
                if(rightNum==k){
                    rightCount++;
                }else{
                    break;              
                }
            }
            count += rightCount;
        }
        return count;
    }
}