Gusto


class Node:
    def __init__(self,val):
        self.left = None
        self.right = None
        self.val = val
import re
import collections
class Solution:
    """
    @param nums: 
    @return: the maximum result of ai XOR aj, where 0 ≤ i, j < n
    """

    def sendMoney(self,mm,amount):
        mm =sorted(mm.items(),key=lambda x:(x[1],x[0]))
        avg = amount // len(mm)
        pos = 0
        res={}
        for i,(k,v) in enumerate(mm):
            if v <= avg:
                amount -= v
                res[k] = v
            else:
                pos = i
                break
        navg = amount//len(mm[pos:])
        rem = amount % len(mm[pos:])
        for i,(k,_) in enumerate(mm[pos:]):
            res[k] = navg + 1 if i < rem else navg
        return res

dict sort test

embold HTML

Last updated

Was this helpful?