leetcode 307. Range Sum Query - Mutable【线段树，指针】

Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive.

The update(i, val) function modifies nums by updating the element at index i to val.

Example:

Given nums = [1, 3, 5]

sumRange(0, 2) -> 9
update(1, 2)
sumRange(0, 2) -> 8

Note:

1. The array is only modifiable by the update function.
2. You may assume the number of calls to update and sumRange function is distributed evenly.

MDZZ leetcode没数据范围，线段树就只能用指针做

各种调试bug

好歹最终写出来了QAQ

思路就是模版

太菜了

class NumArray {
public:
    struct node {
        int l, r, sum;
        node *left, *right;
    };
    node *root = new node();
    int len;
    void build(node *root, int l, int r, vector<int>& nums) {
        root->l = l;
        root->r = r;
        if (l == r) {
            root->sum = nums[l];
            printf("build:l=%d,r=%d,sum=%d\n",l,r,root->sum);
            return;
        }
        int mid = (l + r) >> 1;
        node *leftNode = new node();
        node *rightNode = new node();
        root->left = leftNode;
        root->right = rightNode;
        build(root->left, l, mid, nums);
        build(root->right, mid + 1, r, nums);
        root->sum = root->left->sum + root->right->sum;
        printf("build:l=%d,r=%d,sum=%d\n",l,r,root->sum);
    }
    NumArray(vector<int>& nums) {
        len = nums.size();
        if (len == 0)
            root->sum = 0;
        else
            build(root, 0, len - 1, nums);
    }
    void updateNode(node *root, int i, int val) {
        //printf("updateNode:root=%d,l=%d, r=%d\n", root, l, r);
        if (root -> l ==  root -> r && root -> l == i) {
            root -> sum = val;
            return;
        }
        int mid = (root -> l + root -> r) >> 1;
        if (i <= mid) 
            updateNode(root -> left, i, val);
        else
            updateNode(root -> right, i, val);
        root -> sum = root -> left -> sum + root -> right -> sum;
    }
    void update(int i, int val) {
        updateNode(root, i, val);
    }
    int sumNode(node *root, int l ,int r) {
        printf("query:l=%d,r=%d,root->l=%d,root->r=%d\n", l, r, root->l, root->r);
        if (l <= root -> l && r >= root -> r) {
            return root -> sum;
        }
        int mid = (root -> l + root -> r) >> 1;
        int sum = 0;
        if (l <= mid) 
            sum += sumNode(root -> left, l, r);
        if (r > mid) 
            sum += sumNode(root -> right, l, r);
        return sum;
    }
    int sumRange(int i, int j) {
        return sumNode(root, i, j);
    }
};

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