【LeetCode】1013. Pairs of Songs With Total Durations Divisible by 60（取模）

最新推荐文章于 2021-05-30 11:51:27 发布

hh66__66hh

最新推荐文章于 2021-05-30 11:51:27 发布

阅读量396

点赞数

分类专栏：刷题

本文链接：https://blog.csdn.net/hh66__66hh/article/details/88618151

版权

刷题专栏收录该内容

27 篇文章 0 订阅

订阅专栏

【LeetCode】1013. Pairs of Songs With Total Durations Divisible by 60（取模）

题目

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[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

思路

这题其实蛮简单的，注意的地方有两个：
（1） $\% 60 = (a \%60 + b\%60) \% 60$ 。因此，可以在遍历给定数组的时候，可以直接将每个数向60取模；
（2）将数据离散化。

代码

class Solution {
public:
    int numPairsDivisibleBy60(vector<int>& time) {
        int i, j, k, s, ans;
        map<int, int>m;
        m.clear();

        ans = 0;
        for(i=0; i<time.size(); ++i) {
            s = time[i] % 60;
            j = (60 - s)%60;
            ans += (m.count(j)==0 ? 0 : m[j]);
            m.count(s) == 0 ? m[s]=1 : m[s]++;
        }
        return ans;
    }
};