mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
34 lines
1.1 KiB
HTML
34 lines
1.1 KiB
HTML
|
<p>Given an integer array <code>nums</code>, return the sum of <code>floor(nums[i] / nums[j])</code> for all pairs of indices <code>0 <= i, j < nums.length</code> in the array. Since the answer may be too large, return it <strong>modulo</strong> <code>10<sup>9</sup> + 7</code>.</p>
|
||
|
|
|
||
|
|
<p>The <code>floor()</code> function returns the integer part of the division.</p>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
<p><strong>Example 1:</strong></p>
|
||
|
|
|
||
|
|
<pre>
|
||
|
|
<strong>Input:</strong> nums = [2,5,9]
|
||
|
|
<strong>Output:</strong> 10
|
||
|
|
<strong>Explanation:</strong>
|
||
|
|
floor(2 / 5) = floor(2 / 9) = floor(5 / 9) = 0
|
||
|
|
floor(2 / 2) = floor(5 / 5) = floor(9 / 9) = 1
|
||
|
|
floor(5 / 2) = 2
|
||
|
|
floor(9 / 2) = 4
|
||
|
|
floor(9 / 5) = 1
|
||
|
|
We calculate the floor of the division for every pair of indices in the array then sum them up.
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p><strong>Example 2:</strong></p>
|
||
|
|
|
||
|
|
<pre>
|
||
|
|
<strong>Input:</strong> nums = [7,7,7,7,7,7,7]
|
||
|
|
<strong>Output:</strong> 49
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
<p><strong>Constraints:</strong></p>
|
||
|
|
|
||
|
|
<ul>
|
||
|
|
<li><code>1 <= nums.length <= 10<sup>5</sup></code></li>
|
||
|
|
<li><code>1 <= nums[i] <= 10<sup>5</sup></code></li>
|
||
|
|
</ul>
|