leetcode

我的 leetcode 题解(JavaScript)


const minMeetingRooms = function (intervals) {
  let starts = [],
    ends = [],
    res = 0,
    endpos = 0;
  for (let a in intervals) {
    starts.push(intervals[a][0]);
    ends.push(intervals[a][1]);
  }
  starts.sort((a, b) => a - b);
  ends.sort((a, b) => a - b);
  for (let i = 0; i < intervals.length; ++i) {
    if (starts[i] < ends[endpos]) ++res;
    else ++endpos;
  }
  return res;
}