mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
32 lines
1.2 KiB
HTML
32 lines
1.2 KiB
HTML
<p>You are given a list of songs where the <code>i<sup>th</sup></code> song has a duration of <code>time[i]</code> seconds.</p>
|
|
|
|
<p>Return <em>the number of pairs of songs for which their total duration in seconds is divisible by</em> <code>60</code>. Formally, we want the number of indices <code>i</code>, <code>j</code> such that <code>i < j</code> with <code>(time[i] + time[j]) % 60 == 0</code>.</p>
|
|
|
|
<p> </p>
|
|
<p><strong class="example">Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> time = [30,20,150,100,40]
|
|
<strong>Output:</strong> 3
|
|
<strong>Explanation:</strong> 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
|
|
</pre>
|
|
|
|
<p><strong class="example">Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> time = [60,60,60]
|
|
<strong>Output:</strong> 3
|
|
<strong>Explanation:</strong> All three pairs have a total duration of 120, which is divisible by 60.
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= time.length <= 6 * 10<sup>4</sup></code></li>
|
|
<li><code>1 <= time[i] <= 500</code></li>
|
|
</ul>
|