65.区域和检索 - 数组不可变
题目内容:
代码及思路:
class NumArray {
public:
vector<int> num;
NumArray(vector<int>& nums) {
for(int i=0;i<nums.size();i++)
{
num.push_back(nums[i]);
}
}
int sumRange(int i, int j) {
int sum=0;
for(int index=i;index<=j;index++)
{
sum+=num[index];
}
return sum;
}
};
/**
* Your NumArray object will be instantiated and called as such:
* NumArray* obj = new NumArray(nums);
* int param_1 = obj->sumRange(i,j);
*/