LeetCode--303. Range Sum Query - Immutable

<h3>303. Range Sum Query - Immu<em>table</em></h3><div class="row"><div class="col-md-12"><div class="question-info text-info"><ul><li>Total Accepted: <strong>37464</strong></li><li>Total Submissions: <strong>147649</strong></li><li>Difficulty: <strong>Easy</strong></li></ul>            </div>            <div class="question-content">              <p>Given an integer array <em>nums</em>, find the sum of the elements between indices <em>i</em> and <em>j</em> (<em>i</em> ≤ <em>j</em>), inclusive.</p><p><strong>Example:</strong>
</p><pre>Given nums = [-2, 0, 3, -5, 2, -1]

sumRange(0, 2) -> 1
sumRange(2, 5) -> -1
sumRange(0, 5) -> -3

Note:

1. You may assume that the array does not change.
2. There are many calls to sumRange function.

Subscribe to see which companies asked this question

public class NumArray { private int[] sum = null; public NumArray(int[] nums) { int size = nums.length; sum[0] = nums[0]; for (int i = 1; i < size; i++) sum[i] = sum[i-1] + nums[i]; } public int sumRange(int i, int j) { if (i == 0) return sum[j]; return sum[j] - sum[i-1]; }}// Your NumArray object will be instantiated and called as such:// NumArray numArray = new NumArray(nums);// numArray.sumRange(0, 1);// numArray.sumRange(1, 2);

Error! Runtime Error Message: Line 5: java.lang.NullPointerException.    Because at that time, sum still is null. 

So, we may use this method to make sum not null!

public class NumArray {
    private int[] sum = null;
    public NumArray(int[] nums) {
        sum = nums;
        int size = nums.length;
        if (size > 1){
        for (int i = 1; i < size; i++) sum[i] = sum[i-1] + nums[i];}
    }

    public int sumRange(int i, int j) {
        if (i == 0) return sum[j];
        return sum[j] - sum[i-1];
    }
}


// Your NumArray object will be instantiated and called as such:
// NumArray numArray = new NumArray(nums);
// numArray.sumRange(0, 1);
// numArray.sumRange(1, 2);

What's more, pay attention to the if (size > 1) clause, because the input may be []. So, it's necessary!