303. 区域和检索 - 数组不可变 - 力扣(LeetCode) (leetcode-cn.com)
class NumArray {
vector<int>nums;
public:
NumArray(vector<int>& nums) {
this->nums=nums;
}
int sumRange(int left, int right) {
int sum=0;
for(int i=left;i<=right;i++) sum+=nums[i];
return sum;
}
};