No.44-LeetCode303 前缀和

最新推荐文章于 2024-07-09 00:00:00 发布

ShellDawn

最新推荐文章于 2024-07-09 00:00:00 发布

阅读量256

点赞数

分类专栏： leetcode 文章标签： LeetCode

本文链接：https://blog.csdn.net/ShellDawn/article/details/98539017

版权

leetcode 专栏收录该内容

251 篇文章 0 订阅

订阅专栏

class NumArray {
public:
    vector<int> sum;
    NumArray(vector<int>& nums) {
        int L = nums.size();
        sum.reserve(L+1);
        sum[0] = 0;
        for(int i=1;i<=L;i++){
            sum[i] = sum[i-1] + nums[i-1];
        }
    }
    
    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);
 */