Class NumArray
-
- All Implemented Interfaces:
public final class NumArray
303 - Range Sum Query - Immutable\.
Easy
Given an integer array
nums
, handle multiple queries of the following type:Calculate the sum of the elements of
nums
between indicesleft
andright
inclusive whereleft <= right
.
Implement the
NumArray
class:NumArray(int[] nums)
Initializes the object with the integer arraynums
.int sumRange(int left, int right)
Returns the sum of the elements ofnums
between indicesleft
andright
inclusive (i.e.nums[left] + nums[left + 1] + ... + nums[right]
).
Example 1:
Input "NumArray", "sumRange", "sumRange", "sumRange" [[-2, 0, 3, -5, 2, -1], 0, 2, 2, 5, 0, 5]
Output: null, 1, -1, -3
Explanation: NumArray numArray = new NumArray(-2, 0, 3, -5, 2, -1); numArray.sumRange(0, 2); // return (-2) + 0 + 3 = 1 numArray.sumRange(2, 5); // return 3 + (-5) + 2 + (-1) = -1 numArray.sumRange(0, 5); // return (-2) + 0 + 3 + (-5) + 2 + (-1) = -3
Constraints:
<code>1 <= nums.length <= 10<sup>4</sup></code>
<code>-10<sup>5</sup><= numsi<= 10<sup>5</sup></code>
0 <= left <= right < nums.length
At most <code>10<sup>4</sup></code> calls will be made to
sumRange
.