FilesExpand file tree

 master

/

RangeSumQueryImmutable303.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

42 lines (34 loc) · 913 Bytes

 master

/

RangeSumQueryImmutable303.java

Copy path

Top

File metadata and controls

• Code
• Blame

42 lines (34 loc) · 913 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

/**

* Given an integer array nums, find the sum of the elements between indices

* i and j (i ≤ j), inclusive.

*

* Example:

* Given nums = [-2, 0, 3, -5, 2, -1]

*

* sumRange(0, 2) -> 1

* sumRange(2, 5) -> -1

* sumRange(0, 5) -> -3

*

* Note:

* You may assume that the array does not change.

* There are many calls to sumRange function.

*/

public class RangeSumQueryImmutable303 {

class NumArray {

private int[] sum;

public NumArray(int[] nums) {

sum = new int[nums.length+1];

for (int i=1; i<=nums.length; i++) {

sum[i] = sum[i-1] + nums[i-1];

}

}

public int sumRange(int i, int j) {

return sum[j+1] - sum[i];

}

}

/**

* Your NumArray object will be instantiated and called as such:

* NumArray obj = new NumArray(nums);

* int param_1 = obj.sumRange(i,j);

*/

}