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

题目描述

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

Solution

取得第一个k的下标和第一个k+1的下标，个数为k+1下标-k下标

public class Solution {
    public int GetNumberOfK(int [] array , int k) {
        int first = binarySearch(array, k);
        int last = binarySearch(array, k + 1);
        return (first == array.length || array[first] != k) ? 0 : last - first; 
    }
    
    public int binarySearch(int[] num, int k) {
        int l = 0, h = num.length - 1;
        while (l <= h) {
            int m = l + (h - l) / 2;
            if (num[m] > k) {
                h = m - 1;
            } else if (num[m] < k){
                l = m + 1;
            } else if (m-1 >= l && num[m-1] == k) {
                h = m - 1;
            } else {
                return m;
            }
        }
        return l;
    }
}

这里的考虑的是升序排序
二分查找找到第一个K和最后一个K的下标，得到个数

public class Solution {
	    public int GetNumberOfK(int [] array , int k) {
	       int n = array.length;
	       if (n == 0) {
	    	   return 0;
	       }
	       int firstK = getFirstK(array, k, 0, n-1);
	       int lastK = getLastK(array, k, 0, n-1);
	       if (firstK != -1 && lastK != -1) {
	    	   return lastK - firstK + 1;
	       }
	       return 0;
	    }
	    //递归二分
	    public int getFirstK(int [] array, int k, int start, int end) {
	    	if (start > end) {
	    		return -1;
	    	}
	    	int mid = start + ((end - start) >> 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 >= start && array[mid - 1] == k) {
	    		return getFirstK(array, k, start, mid-1);
	    	} else {
	    		return mid;
	    	}
	    }
	    //循环二分
	    public int getLastK(int [] array, int k, int start, int end) {
	    	int mid = start + ((end - start) >> 1);
	    	while (start <= end) {
	    		if (array[mid] > k) {
	    			end = mid - 1;
	    		} else if (array[mid] < k) {
	    			start = mid + 1;
	    		} else if (mid + 1 <= end && array[mid+1] == k) {
	    			start = mid + 1;
	    		} else {
	    			return mid;
	    		}
	    		mid = start + ((end - start) >> 1);
	    	}
	    	return -1;
	    }
	    
	}