python-递归合并字典

def r(lef,rig):    lef = lef[0]    rig = rig[0]        result = []    tmp = {}    for k,v in lef.items():        s = tmp.get(k,0)        s += int(v)        tmp[k] = s        for k,v in rig.items():        s = tmp.get(k,0)        s += int(v)        tmp[k] = s    result.append(tmp)    return result        def topKey(data):    lens = len(data)    if lens <= 1:        return data    m = lens / 2    left = topKey(data[:m])    right = topKey(data[m:])    return r(left,right)data = [{'r':0,'f':4,'s':5},{'s':2,'f':3},{'s':'1','f':'9'},{'r':2}]print topKey(data)