• Home
• com.github.javadev
• leetcode-in-java
• 1.38
• source code
• readme.md

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

g1801_1900.s1862_sum_of_floored_pairs.readme.md Maven / Gradle / Ivy

1862\. Sum of Floored Pairs

Hard

Given an integer array `nums`, return the sum of `floor(nums[i] / nums[j])` for all pairs of indices `0 <= i, j < nums.length` in the array. Since the answer may be too large, return it **modulo** 109 + 7.

The `floor()` function returns the integer part of the division.

**Example 1:**

**Input:** nums = [2,5,9]

**Output:** 10

**Explanation:** 

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.

**Example 2:**

**Input:** nums = [7,7,7,7,7,7,7]

**Output:** 49

**Constraints:**

*   1 <= nums.length <= 105
*   1 <= nums[i] <= 105