
Given an integer array nums , handle multiple queries of the following types:
Update the value of an element in nums .
Calculate the sum of the elements of nums between indices left and right inclusive where left <= right .
Implement the NumArray class:
NumArray(int[] nums) Initializes the object with the integer array nums .
void update(int index, int val) Updates the value of nums[index] to be val .
int sumRange(int left, int right) Returns the sum of the elements of nums between indices left and right inclusive (i.e. nums[left] + nums[left + 1] + ... + nums[right] ).
1 <= nums.length <= 3 * 10 ^4-100 <= nums[i] <= 1000 <= index < nums.length-100 <= val <= 1000 <= left <= right < nums.lengthAt most 3 * 10 ^4 calls will be made to update and sumRange .