• <ins id="pjuwb"></ins>
    <blockquote id="pjuwb"><pre id="pjuwb"></pre></blockquote>
    <noscript id="pjuwb"></noscript>
          <sup id="pjuwb"><pre id="pjuwb"></pre></sup>
            <dd id="pjuwb"></dd>
            <abbr id="pjuwb"></abbr>

            Uriel's Corner

            Research Associate @ Harvard University / Research Interests: Computer Vision, Biomedical Image Analysis, Machine Learning
            posts - 0, comments - 50, trackbacks - 0, articles - 594
            構建一個data stream,有以下三種操作:

            SummaryRanges() -> Initializes the object with an empty stream.
            void addNum(int value) -> Adds the integer value to the stream.
            int[][] getIntervals() -> Returns a summary of the integers in the stream currently as a list of disjoint intervals [starti, endi]. The answer should be sorted by starti.

            Discussion中有人使用python的Sorted List,其實不必,參考->https://leetcode.com/problems/data-stream-as-disjoint-intervals/solutions/531106/python-solution-using-bisect-to-do-binary-search-beating-99-5-in-time/

            初始化兩個intervals:[[-10001, -10001], [10001, 10001]] (比data stream小1或者大1即可),每次插入時調用bisect.bisect返回該插入在何處,通過判斷當前要插入的值是否與前一個或者后一個區間有overlap來決定是否需要合并區間


             1 #352
             2 #Runtime: 115 ms (Beats 100%)
             3 #Memory: 18.5 MB (Beats 88.46%)
             4 
             5 class SummaryRanges(object):
             6 
             7     def __init__(self):
             8         self.ds = [[-10001, -10001], [10001, 10001]]
             9 
            10     def addNum(self, value):
            11         """
            12         :type value: int
            13         :rtype: None
            14         """
            15         idx = bisect.bisect(self.ds, [value])
            16         l1, l2 = self.ds[idx - 1]
            17         r1, r2 = self.ds[idx]
            18         if l2 == value - 1 and r1 == value + 1:
            19             self.ds = self.ds[ : idx - 1] + [[l1, r2]] + self.ds[idx + 1 : ]
            20         elif l2 == value - 1:
            21             self.ds[idx - 1][1] = value
            22         elif r1 == value + 1:
            23             self.ds[idx][0] = value
            24         elif l2 < value - 1 and r1 > value + 1:
            25             self.ds = self.ds[ : idx] + [[value, value]] + self.ds[idx : ]
            26         
            27 
            28     def getIntervals(self):
            29         """
            30         :rtype: List[List[int]]
            31         """
            32         return self.ds[1 : -1]
            33         
            34 
            35 
            36 # Your SummaryRanges object will be instantiated and called as such:
            37 # obj = SummaryRanges()
            38 # obj.addNum(value)
            39 # param_2 = obj.getIntervals()
            欧洲精品久久久av无码电影| 久久午夜免费视频| 欧美日韩精品久久久久| 偷偷做久久久久网站| 久久人做人爽一区二区三区| 国产韩国精品一区二区三区久久| 国产精品久久精品| 精品国产婷婷久久久| 欧美亚洲国产精品久久| 久久精品国产亚洲AV大全| 久久夜色撩人精品国产| 久久午夜羞羞影院免费观看| 国产精品成人精品久久久| 久久久久久久亚洲Av无码| 久久综合久久久| 亚洲精品乱码久久久久久蜜桃不卡| 久久久久无码专区亚洲av| 99久久精品国产高清一区二区| 欧美久久久久久精选9999| www.久久热.com| 久久精品桃花综合| 久久精品国产欧美日韩| 久久久噜噜噜久久中文福利| 色婷婷狠狠久久综合五月| 亚洲国产精品一区二区久久| 久久亚洲高清观看| 一本一本久久a久久综合精品蜜桃| 四虎国产精品成人免费久久| 77777亚洲午夜久久多喷| 99精品久久精品一区二区| 无码精品久久一区二区三区| 久久国产精品二国产精品| 日韩精品国产自在久久现线拍 | 欧美精品国产综合久久| 精品99久久aaa一级毛片| 久久中文娱乐网| 国产91色综合久久免费| 国产一级持黄大片99久久| 一本伊大人香蕉久久网手机| 国内精品人妻无码久久久影院| 久久精品国产精品青草app|