剑指Offer-53 数字在排序数组中出现的次数

题目：

统计一个数字在排序数组中出现的次数。例如输入排序数组[1, 2, 3, 3, 3, 3, 4, 5]和数字3，由于3在这个数组中出现了4次，因此输出4。
样例
输入：[1, 2, 3, 3, 3, 3, 4, 5] , 3
输出：4

解答：

class Solution(object):
    def getNumberOfK(self, nums, k):
        """
        :type nums: list[int]
        :type k: int
        :rtype: int
        """
        number = 0
        s = self.getFirstK(nums, k, 0, len(nums) - 1)
        e = self.getLastK(nums, k, 0, len(nums) - 1)
        if s >= 0 and e >= 0:
            number = e - s + 1
        return number
    
    def getFirstK(self, nums, k, start, end):
        if start > end:
            return -1
        mid = int((start + end)/2)
        if nums[mid] == k:
            if mid > 0 and nums[mid - 1] != k or mid == 0:
                return mid
            else:
                end = mid - 1
        else:
            if nums[mid] > k:
                end = mid - 1
            else:
                start = mid + 1
        return self.getFirstK(nums, k, start, end)
    
    def getLastK(self, nums, k, start, end):
        if start > end:
            return -1
        mid = int((start + end)/2)
        if nums[mid] == k:
            if mid < end and nums[mid + 1] != k or mid == end:
                return mid
            else:
                start = mid + 1
        else:
            if nums[mid] > k:
                end = mid - 1
            else:
                start = mid + 1
        return self.getLastK(nums, k, start, end)