擅长:python、mysql、java
<p>数据结构有一些变化,下面是简单的解决方案:</p>
<pre><code>adict = {0: [10, 20], 1: [15, 25], 2: [20, 40]}
data = [(10, 15), (15, 20), (20, 25), (25, 40)]
# This will check the membership
# in_([3,4], [2,3]) returns True
def in_(val1 , val2):
return val2[0] >= val1[0] and val2[1] <= val1[1]
res = {}
for each in keys:
for key in adict.keys():
if in_(adict[key], each):
res.setdefault(each, []).append(key)
</code></pre>
<p>O/p公司</p>
<pre><code>>>>res
{(10, 15): [0], (15, 20): [0, 1], (25, 40): [2], (20, 25): [1, 2]}
</code></pre>