剑指Offer_编程题37：数字在排序数组中出现的次数(二分法)

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

牛客网：链接

思路：看到排序就要想到二分法。二分查找到给定的数字及其坐标。以该坐标为中点，向前向后找到这个数字的 始 – 终 位置。

low <= high，low = mid + 1, high = mid - 1都必须这么写！如果出现[1,2,3,5,6]和6，不跳过mid，就会出现死循环！

# -*- coding:utf-8 -*-
class Solution:
    def GetNumberOfK(self, data, k):
        # write code here
        if not data or k < data[0]:
            return 0

        low = 0
        high = len(data) - 1

        count = 0
        while low <= high:
            mid = (low+high)//2
            if data[mid] == k:
                tmp = mid
                while tmp >= 0 and data[tmp] == k:
                    count += 1
                    tmp -= 1
                tmp = mid + 1 
                while tmp < len(data) and data[tmp] == k:
                    count += 1
                    tmp += 1
                return count
            elif data[mid] < k:
                low = mid + 1
            else:
                high = mid - 1

        return 0