In a list of songs, the i
-th 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
with (time[i] + time[j]) % 60 == 0
.
Example 1:
Input: [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: [60,60,60] Output: 3 Explanation: All three pairs have a total duration of 120, which is divisible by 60.
Note:
1 <= time.length <= 60000
1 <= time[i] <= 500
Solution: Two Sum of 60
Time complexity: O(n)
Space complexity: O(60)
C++
1 2 3 4 5 6 7 8 9 10 11 12 13 14 |
// Author: Huahua, running time: 36 ms, 11.6 MB class Solution { public: int numPairsDivisibleBy60(vector<int>& time) { vector<int> c(60); int ans = 0; for (int t : time) { t %= 60; ans += c[(60 - t) % 60]; ++c[t]; } return ans; } }; |
请尊重作者的劳动成果,转载请注明出处!花花保留对文章/视频的所有权利。
如果您喜欢这篇文章/视频,欢迎您捐赠花花。
If you like my articles / videos, donations are welcome.
Be First to Comment