2406. Divide Intervals Into Minimum Number of Groups
## 思路
昨天的简单版
把intervals转成新的times (left/right+1 ,state)
sort后扫一遍, 记录重叠intertals个数的最大值
## Code
```python
class Solution:
def minGroups(self, intervals: List[List[int]]) -> int:
times = []
for left, right in intervals:
times.append((left, 1))
times.append((right+1, -1))
times.sort()
res = curr = 0
for _, delta in times:
curr += delta
res = max(res, curr)
return res
```

大师 以后养我