LeetCode-303. Range Sum Query - Immutable

最新推荐文章于 2017-06-01 17:27:42 发布

这个好玩吗

最新推荐文章于 2017-06-01 17:27:42 发布

阅读量277

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/flx413/article/details/52988268

版权

LeetCode 专栏收录该内容

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

构造函数中进行打表，sumRange按下标进行减法计算。

class NumArray {
public:
    NumArray(vector<int> &nums) {
        int curSum = 0;
        sum.push_back( 0 );
        for( int i = 0; i < nums.size(); i++ ) {
            curSum = curSum + nums[i];
            sum.push_back( curSum );
        }
    }

    int sumRange(int i, int j) {
        return sum[j + 1] - sum[i];
    }
    
    vector<int> sum;
};

// 0 -2 -2  1 -4 -2 -3
// 0  1  2  3  4  5  6

// Your NumArray object will be instantiated and called as such:
// NumArray numArray(nums);
// numArray.sumRange(0, 1);
// numArray.sumRange(1, 2);