线段树数组实现解决307区域和检索

最新推荐文章于 2024-08-23 02:52:43 发布

沐雨金鳞

最新推荐文章于 2024-08-23 02:52:43 发布

阅读量189

点赞数

分类专栏： leetecode 文章标签：线段树数组实现

本文链接：https://blog.csdn.net/qq_38262266/article/details/112599745

版权

leetecode 专栏收录该内容

79 篇文章 1 订阅

订阅专栏

线段树数组实现的逻辑比较复杂......借此记录一下吧😭

详见https://leetcode-cn.com/problems/range-sum-query-mutable/solution/xian-duan-shu-zu-shou-hui-tu-xiang-yi-qing-er-chu-/

class NumArray {

    int[] tree;
    int n;

    public NumArray(int[] nums) {
        n = nums.length;
        // 非叶子节点个数为叶子结点个数+1，所以是n*2
        tree = new int[n * 2];

        // 初始化数组，都放在最后
        for(int i = n; i < 2*n; i++){
            tree[i]  = nums[i-n];
        }

        // 初始化数据前面的节点值
        for(int i = n-1; i >= 0; i--){
            tree[i] = tree[i*2] + tree[i*2+1];
        }
    }

    public void update(int i, int val) {
        // 找到索引在数组中的位置
        int pos = n + i;
        // 修改数据
        tree[pos] = val;
        // 修改节点前面与它有关的节点的值
        while(pos > 0){
            int left = pos%2==0? pos: pos-1;
            int right = pos%2==0? pos+1: pos;
            tree[pos/2] = tree[left] + tree[right];
            pos /= 2;
        }
    }

    public int sumRange(int i, int j) {
        int sum = 0;
        int l = n + i;
        int r = n + j;
        while(r >= l){
            if(l % 2 == 1){
                sum += tree[l];
                l++;
            }
            if(r % 2 == 0){
                sum += tree[r];
                r--;
            }
            l /= 2;
            r /= 2;
        }
        return sum;
    }
}

/**
 * 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);
 */