# LeetCode 0327 - Count of Range Sum

# Count of Range Sum

## Desicription

Given an integer array nums, 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 (i ≤ j), inclusive.

**Note:**

A naive algorithm of O(n2) is trivial. You MUST do better than that.

**Example:**

1 | Input: nums = [-2,5,-1], lower = -2, upper = 2, |

## Solution

1 | class Solution { |