leetcode1348

import bisect
class TweetCounts:
    def __init__(self):
        self.records = {}

    def recordTweet(self, tweetName: str, time: int) -> None:
        if tweetName not in self.records:
            self.records[tweetName] =  [time]
        else:
            bisect.insort(self.records[tweetName],time)
            # self.records[tweetName].append(time)

    def getTweetCountsPerFrequency(self, freq: str, tweetName: str, startTime: int, endTime: int) -> 'List[int]':
        result = []
        # self.records[tweetName].sort()
        if tweetName not in self.records:
            return []
        else:
            delta = 0
            if freq == 'minute':
                delta = 60
            elif freq == 'hour':
                delta = 60 * 60
            else:
                delta = 60 * 60 * 24
            i = 0
            I = (endTime - startTime) // delta + 1
            while i < I:
                start = startTime + delta * i
                end = min(startTime + delta * (i + 1),endTime + 1)
                left = bisect.bisect_left(self.records[tweetName], start)
                right = bisect.bisect_left(self.records[tweetName], end)
                count = right - left
                result.append(count)
                i += 1
        return result

算法思路：二分查找。

在插入数据的时候，使用插入排序。

在计算区间内符合条件的数值个数的时候，使用两次二分查找。