1
class NumArray {
2
public:
3
vector<int> v; // vector to store input vector.
4
int sum; // sum of all element of vector
5
NumArray(vector<int> &nums) {
6
v = nums;
7
sum = 0;
8
for (int i = 0; i < nums.size(); i++) {
9
sum += nums[i];
10
}
11
}
12

13
void update(int index, int val) {
14
sum -= v[index]; // subtract old element from sum at index and then update
15
// by adding new element val.
16
v[index] = val;
17
sum += val;
18
}
19

20
int sumRange(int left, int right) {
21
int res = sum;
22
for (int i = 0; i < left; i++) { // subtract all element before left and after right
23
res -= v[i];
24
}
25
for (int i = right + 1; i < v.size(); i++) {
26
res -= v[i];
27
}
28
return res; // return res ie. our answer.
29
}
30
};

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0