第一题python ac代码 akelock = [[1234, 1240], [1236, 1238, 1245, 1250]] count = {} for wake_list in wakelock: for i in range(len(wake_list)): if i % 2 == 0: left = wake_list[i] right = wake_list[i+1] for num in range(left, right): count[num] = count.get(num, 0) + 1 res = [] for wake_list in wakelock: contribute = 0 for i in range(len(wake_list)): if i % 2 == 0: cur_contribute = 0 left = wake_list[i] right = wake_list[i+1] for num in range(left, right): cur_contribute += 1/count[num] contribute += int(cur_contribute) res.append(int(contribute)) print(res)