第三题的代码，没过，大家可以帮忙一起分析下嘛~~ class Solution(): def fun(self, T, employees, times): r = [ ] def sub(n, nums): if n==0 or not nums: return 0 nums.sort(key=lambda x:x[0]) right_edge = nums[0][1] res = 0 cnt = 0 for i in range(len(nums)): x, y = nums[i][0], nums[i][1] if x<=right_edge: cnt += 1 else: res = max(res, cnt) right_edge = y cnt = 0 res = max(res, cnt) return res for i in range(T): ans = sub(employees[i], times[i]) r.append(ans) return r