LeetCode 303. Range Sum Query - Immutable

class NumArray {
private:
    vector<int> dp;
public:
    NumArray(vector<int> &nums) {
        dp.resize(nums.size());
        int sum = 0;
        for(int i = 0 ;i<nums.size();++i)
        {
            sum += nums[i];
            dp[i] = sum;
        }
    }

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