class NumArray {
private:
vector<int> v;
public:
NumArray(vector<int>& nums) {
if(nums.size()==0) return;
v.push_back(nums[0]);
for(int i=1;i<nums.size();i++){
v.push_back(nums[i]+v[i-1]);
}
}
int sumRange(int left, int right) {
if(left==0) return v[right];
return v[right]-v[left-1];
}
};
/**
* Your NumArray object will be instantiated and called as such:
* NumArray* obj = new NumArray(nums);
* int param_1 = obj->sumRange(left,right);
*/
LeetCode-303. 区域和检索 - 数组不可变-easy
最新推荐文章于 2024-05-19 17:14:11 发布