LeetCode 1010. Pairs of Songs With Total Durations Divisible by

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

特殊情况主要是要考虑余数是30跟余数是0的情况，同时只要是int类型，只要乘积了，就要担心溢出的情况，所以一开始跑出来就错误了，还是用long先处理了，再转成int了；；；

Runtime: 10 ms, faster than 51.97% of Java online submissions for Pairs of Songs With Total Durations Divisible by 60.

Memory Usage: 49.1 MB, less than 77.19% of Java online submissions for Pairs of Songs With Total Durations Divisible by 60.