Package g1801_1900.s1862_sum_of_floored_pairs

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    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 &lt;= i, j &lt; nums.length in the array. Since the answer may be too large, return it modulo <code>10<sup>9</sup> + 7</code>.

    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:

    • <code>1 <= nums.length <= 10<sup>5</sup></code>

    • <code>1 <= numsi<= 10<sup>5</sup></code>

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer sumOfFlooredPairs(IntArray nums)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait