303. Range Sum Query - Immutable

最新推荐文章于 2024-08-07 08:23:35 发布

笨笨De蜗牛

最新推荐文章于 2024-08-07 08:23:35 发布

阅读量224

点赞数

分类专栏： LEETCODE

本文链接：https://blog.csdn.net/a342500329a/article/details/50965948

版权

LEETCODE 专栏收录该内容

155 篇文章 0 订阅

订阅专栏

Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive.

Example:

Given nums = [-2, 0, 3, -5, 2, -1]

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


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

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