LintCode_206 Interval Sum

Given an integer array (index from 0 to n-1, where n is the size of this array), and an query list. Each query has two integers[start, end]. For each query, calculate the sum number between index start and end in the given array, return the result list.

 Notice

We suggest you finish problem Segment Tree Build, Segment Tree Queryand Segment Tree Modify first.

Have you met this question in a real interview? 

Yes

Example

For array [1,2,7,8,5], and queries [(0,4),(1,2),(2,4)], return[23,9,20]

Challenge 

O(logN) time for each query

同样用线段树解决， 注意左闭右开：

/**
 * Definition of Interval:
 * classs Interval {
 *     int start, end;
 *     Interval(int start, int end) {
 *         this->start = start;
 *         this->end = end;
 *     }
 */
class Solution { 
public:
    /**
     *@param A, queries: Given an integer array and an query list
     *@return: The result list
     */
    vector<long long> intervalSum(vector<int> &A, vector<Interval> &queries) {
        // write your code here
        vector<long long> res;
        vector<long long> dat = init(A);
        for (int i = 0; i < queries.size(); i++) {
            long long sum = query(dat, queries[i].start, queries[i].end + 1, 
                                  0, 0, dat.size() / 2);
            res.push_back(sum);
        }
        return res;
    }
    vector<long long> init (vector<int>& A) {
        int len = A.size();
        int n = 1;
        while (n < len) {
            n *= 2;
        }
        vector<long long> dat(2 * n, 0);
        for (int i = 0; i < A.size(); i++) {
            update(dat, i , A[i]);
        }
        // int l = dat.size();
        // for (int i = 0; i < l; i++) {
        //     cout<<dat[i]<<" ";
        // }
        // cout<<""<<endl;
        return dat;
    }
    void update(vector<long long>& dat, int k, int value) {
        int n = dat.size() / 2;
        k += (n - 1);
        dat[k] = value;
        while ( k > 0) {
            k = (k - 1) / 2;
            dat[k]+=value;
        }
    }
    long long query(vector<long long>& dat, int a, int b, int k, int l, int r) {
        if (r <= a || b <= l) {
            return 0;
        }
        if (a <= l && r <= b) {
            return dat[k];
        } else {
            long long sum1 = query(dat, a, b, k * 2 + 1, l, (l + r) / 2);
            long long sum2 = query(dat, a, b, k * 2 + 2, (l + r) / 2, r);
            return sum1 + sum2;
        }
    }
};