{"push_id":1436782028,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"2814fa5c0dd0296244639ad82bb597f9e7c84c01","before":"7384a6507a73103d26554b73861e91f333038f21","commits":[{"sha":"2814fa5c0dd0296244639ad82bb597f9e7c84c01","author":{"name":"dubshfjh","email":"73eac66c296cce54fd93912637fb44c680b0acbc@gmail.com"},"message":"算法思想：首先按照end升序对intervals进行排序，然后用迭代器it_i从头开始遍intervals，分析it_j={it_i+1,...}，如果it_j与it_i区间有重叠，即(*it_j).start < (*it_i).end，则it_j++分析后一个元素(并且需移除元素数目++)，直至it_j == intervals.end()或者(*it_j).start >= (*it_i).end后，将it_i 右移到 it_j的位置","distinct":true,"url":"https://api.github.com/repos/dubshfjh/LeetCode/commits/2814fa5c0dd0296244639ad82bb597f9e7c84c01"}]}
{"actor":{"display_login":"dubshfjh"}}