leetCode303

版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。

本文链接： https://blog.csdn.net/qq_36257146/article/details/102708736

这道题在紫书上有。

class NumArray {
public:
    NumArray(vector<int>& nums) {
        if(nums.size() == 0) return;
        for(int i = 0;i<nums.size();i++)
        {
            sum[i] = 0;
        }
        sum[0] = nums[0];
        for(int i = 1;i<nums.size();i++) sum[i] = sum[i-1]+nums[i];
    }
    
    int sumRange(int i, int j) {
        if(i == 0) return sum[j];
        return sum[j]-sum[i-1];
    }
private:
    int sum[10000];
};

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