LeetCode 1010 Pairs of Songs With Total Durations Divisible by 60 (hash)

You are given a list of songs where the ith song has a duration of time[i] seconds.

Return the number of pairs of songs for which their total duration in seconds is divisible by 60. Formally, we want the number of indices i, j such that i < j with (time[i] + time[j]) % 60 == 0.

Example 1:

Input: time = [30,20,150,100,40]
Output: 3
Explanation: Three pairs have a total duration divisible by 60:
(time[0] = 30, time[2] = 150): total duration 180
(time[1] = 20, time[3] = 100): total duration 120
(time[1] = 20, time[4] = 40): total duration 60

Example 2:

Input: time = [60,60,60]
Output: 3
Explanation: All three pairs have a total duration of 120, which is divisible by 60.

Constraints:

• 1 <= time.length <= 6 * 104
• 1 <= time[i] <= 500

题目链接：https://leetcode.com/problems/pairs-of-songs-with-total-durations-divisible-by-60/

题目大意：求多少个pair的和是60的倍数

题目分析：记各余数的个数，除了0和30的pair个数是C(n ,2)，其他直接累乘即可，余数的和为60则原数和必然是60的倍数

3ms，时间击败86.8%

class Solution {
    
    private int calSum(int x) {
        if (x % 2 == 0) {
            return x / 2 * (x - 1);
        }
        return (x - 1) / 2 * x;
    }
    
    public int numPairsDivisibleBy60(int[] time) {
        int[] cnt = new int[60];
        for (int t : time) {
            cnt[t % 60]++;
        }
        int ans = calSum(cnt[0]) + calSum(cnt[30]);
        for (int i = 1; i < 30; i++) {
            ans += cnt[60 - i] * cnt[i];
        }
        return ans;
    }
}