LeetCode.303.Range Sum Query - Immutable

最新推荐文章于 2022-10-26 15:00:30 发布

happyxuma1991

最新推荐文章于 2022-10-26 15:00:30 发布

阅读量198

点赞数

分类专栏： leetcode-easy 文章标签：算法题

本文链接：https://blog.csdn.net/happyxuma1991/article/details/50955438

版权

leetcode-easy 专栏收录该内容

4 篇文章 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

Note:

You may assume that the array does not change.
There are many calls to sumRange function.

Subscribe to see which companies asked this question

class NumArray {
public:
    NumArray(vector<int> &nums) {
        
       if (nums.empty())
            return ;
        else
        {
            sums.push_back(nums[0]);
            //求得给定数列长度
            int len = nums.size();
            for (int i = 1; i < len; ++i)
            {
                sums.push_back(sums[i - 1] + nums[i]);
            }//for
    }
    }

    int sumRange(int i, int j) {
       if (0 == i)
            return sums[j];
        int len = sums.size();

        if (i < 0 || i >= len || j < 0 || j >= len || i > j)
        {
            return 0;
        }//if
        return sums[j] - sums[i-1];
        
    }
   
private:
    vector<int> sums;
};