Package g0301_0400.s0327_count_of_range_sum

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    327 - Count of Range Sum\.

    Hard

    Given an integer array nums and two integers lower and upper, return the number of range sums that lie in [lower, upper] inclusive.

    Range sum S(i, j) is defined as the sum of the elements in nums between indices i and j inclusive, where i <= j.

    Example 1:

    Input: nums = -2,5,-1, lower = -2, upper = 2

    Output: 3

    Explanation: The three ranges are: 0,0, 2,2, and 0,2 and their respective sums are: -2, -1, 2.

    Example 2:

    Input: nums = 0, lower = 0, upper = 0

    Output: 1

    Constraints:

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

    • <code>-2<sup>31</sup><= numsi<= 2<sup>31</sup> - 1</code>

    • <code>-10<sup>5</sup><= lower <= upper <= 10<sup>5</sup></code>

    • The answer is guaranteed to fit in a 32-bit integer.

    • 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 countRangeSum(IntArray nums, Integer lower, Integer upper)

      • Methods inherited from class java.lang.Object

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