303. Range Sum Query - Immutable （前缀数组）

https://leetcode.com/problems/range-sum-query-immutable/description/

题目： 求数组某段区间的值。
思路：直接用前缀和就行了，注意特殊情况的考虑。

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

    int sumRange(int i, int j) {
      if(i==0) return sum[j];
        if(i<0||j<0||i>=sum.size()||j>=sum.size()) return 0;
        return sum[j]-sum[i-1];
    }
private:
    vector<int>sum;
};

/**
 * Your NumArray object will be instantiated and called as such:
 * NumArray obj = new NumArray(nums);
 * int param_1 = obj.sumRange(i,j);
 */