leetcode1010

class Solution:
    def numPairsDivisibleBy60(self, time: 'List[int]') -> int:
        sums = 0
        s = {}
        n = len(time)
        if n>=20:
            targets = []
            for i in range(1,19):
                targets.append(60*i)
            for i in range(len(time)):
                cur = time[i]
                for tar in targets:
                    cop = tar - cur
                    if cop < 0:
                        continue
                    elif cop > 500:
                        break
                    elif cop in s.keys():
                        sums += s[cop]
                if cur in s.keys():
                    s.update({cur:s[cur]+1})
                else:
                    s.update({cur:1})
        else:
            for i in range(len(time)):
                for j in range(i+1,len(time)):
                    if (time[i]+time[j])%60==0:
                        sums+=1
        return sums

 下面这个是简写：

class Solution:
    def numPairsDivisibleBy60(self, time: 'List[int]') -> int:
        c = collections.Counter()
        res = 0
        for t in time:
            res += c[-t % 60]
            c[t % 60] += 1
        return res