Package g2501_2600.s2563_count_the_number_of_fair_pairs

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    2563 - Count the Number of Fair Pairs\.

    Medium

    Given a 0-indexed integer array nums of size n and two integers lower and upper, return the number of fair pairs.

    A pair (i, j) is fair if:

    • 0 <= i < j < n, and

    • lower <= nums[i] + nums[j] <= upper

    Example 1:

    Input: nums = 0,1,7,4,4,5, lower = 3, upper = 6

    Output: 6

    Explanation: There are 6 fair pairs: (0,3), (0,4), (0,5), (1,3), (1,4), and (1,5).

    Example 2:

    Input: nums = 1,7,9,2,5, lower = 11, upper = 11

    Output: 1

    Explanation: There is a single fair pair: (2,3).

    Constraints:

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

    • nums.length == n

    • <code>-10<sup>9</sup><= numsi<= 10<sup>9</sup></code>

    • <code>-10<sup>9</sup><= lower <= upper <= 10<sup>9</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 Long countFairPairs(IntArray nums, Integer lower, Integer upper)

      • Methods inherited from class java.lang.Object

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