百度笔试 9.3

class Solution:

def merge (self, intervals, L):

intervals.sort(key= lambdax:x[0])

merged = [0]*L

for interval inintervals:

for i inrange(interval[0]- 1,interval[1]):

merged[i] +=1

return merged

# if __name__ == '__main__':

s = Solution()

T = int(input ())

L, n = map (int,input ().split())

for i in range (T):

intervals = []

for j in range(n):

x,y=map (int,input ().split())

intervals.append([x,y])

a=s.merge(intervals,L)

for num ina:

print(num ,end=' ')