- Meeting Scheduler
一个很好的计算两个区间是否重合的方式,并可以计算重合点数据区间长度
计算头的最大值, 尾的最小值即可
int ibegin = slots1[i][0], iend = slots1[i][1], jbegin = slots2[j][0], jend = slots2[j][1];
int head = max(ibegin,jbegin), tail = min(iend,jend);
tail-head
int ibegin = slots1[i][0], iend = slots1[i][1], jbegin = slots2[j][0], jend = slots2[j][1];
int head = max(ibegin,jbegin), tail = min(iend,jend);
tail-head