LeetCode:307. 区域和检索 - 数组可修改

    技术2022-07-10  119

    class NumArray { public: vector<int> num; NumArray(vector<int>& nums) { num=nums; } void update(int i, int val) { num[i]=val; } int sumRange(int i, int j) { return accumulate(num.begin()+i,num.begin()+1+j,0); } }; /** * Your NumArray object will be instantiated and called as such: * NumArray* obj = new NumArray(nums); * obj->update(i,val); * int param_2 = obj->sumRange(i,j); */
    Processed: 0.021, SQL: 9