LeetCode 303. Range Sum Query - Immutable

class NumArray {
public:
    vector<int> dp;
    NumArray(vector<int> nums) {
        dp.clear();
        int n = nums.size();
        if(n==0) return;
        dp.push_back(nums[0]);
        for(int i=1;i<n;i++)
        {
            dp.push_back(nums[i] +dp[i-1]);
        }
    }

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

/**
 * Your NumArray object will be instantiated and called as such:
 * NumArray obj = new NumArray(nums);
 * int param_1 = obj.sumRange(i,j);
 */