LeetCode刷题记178-307. 区域和检索 - 数组可修改

LeetCode刷题记178

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

题目

class NumArray {
    int[] _nums;
    int[] sum;

    public int lowbit(int x) {
        return x & (-x);
    }

    public NumArray(int[] nums) {
        _nums = new int[nums.length + 1];
        sum = new int[nums.length + 1];
        for (int i = 0; i < nums.length; i ++) {
            update(i, nums[i]);
        }
    }
    
    public void update(int index, int val) {
        index ++;  // 树状数组是从1开始的下标
        int _val = val - _nums[index];
        _nums[index] = val;
        while (index < _nums.length) {
            sum[index] += _val;
            index += lowbit(index);
        }
    }

    public int query(int index) {
        int ans = 0;
        while (index > 0) {
            ans += sum[index];
            index -= lowbit(index);
        }
        return ans;
    }
    
    public int sumRange(int left, int right) {
        return query(right + 1) - query(left);
    }
}

/**
 * Your NumArray object will be instantiated and called as such:
 * NumArray obj = new NumArray(nums);
 * obj.update(index,val);
 * int param_2 = obj.sumRange(left,right);
 */