[LeetCode] Range Sum Query - Mutable

最新推荐文章于 2025-08-15 23:10:13 发布

weixin_34166472

最新推荐文章于 2025-08-15 23:10:13 发布

阅读量53

点赞数

CC 4.0 BY-SA版权

文章标签： java

原文链接：http://www.cnblogs.com/jcliBlogger/p/4989021.html

本文介绍了一种新的数据结构——段树，并提供了一个简洁的C++实现案例。该段树可用于快速更新区间和等操作，代码遵循LeetCode的定义结构和类规范。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

This problem requires a new data structure --- Segment Tree. You may use this GeeksforGeeks article to get some ideas of it. However, the code in this article may be too verbose. To solve this problem using segment tree, 2guotou has posted a very nice Java code, which is rewritten below in C++. I try to conform to the LeetCode traditions of defining structures and classes.

 1 struct SegmentTreeNode {
 2     int s, e, sum;
 3     SegmentTreeNode* left;
 4     SegmentTreeNode* right;
 5     SegmentTreeNode(int _s, int _e) : s(_s), e(_e), sum(0), left(NULL), right(NULL) {}
 6 };
 7 
 8 class SegmentTree {
 9 public:
10     SegmentTree(vector<int>& nums) {
11         int n = nums.size();
12         root = buildST(nums, 0, n - 1);
13     }
14 
15     void update(int i, int val) {
16         update(root, i, val);
17     }
18 
19     int sumRange(int i, int j) {
20         return sumRange(root, i, j);
21     }
22 private:
23     SegmentTreeNode* root;
24     SegmentTreeNode* buildST(vector<int>& nums, int s, int e) {
25         if (s > e) return NULL;
26         else {
27             SegmentTreeNode* res = new SegmentTreeNode(s, e);
28             if (s == e) res->sum = nums[s];
29             else {
30                 int m = s + (e - s) / 2;
31                 res->left = buildST(nums, s, m);
32                 res->right = buildST(nums, m + 1, e);
33                 res->sum = res->left->sum + res->right->sum;
34             }
35             return res;
36         }
37     }
38     void update(SegmentTreeNode* root, int i, int val) {
39         if (root->s == root->e) root->sum = val;
40         else {
41             int m = root->s + (root->e - root->s) / 2;
42             if (i <= m) update(root->left, i, val);
43             else update(root->right, i, val);
44             root->sum = root->left->sum + root->right->sum;
45         }
46     }
47     int sumRange(SegmentTreeNode* root, int s, int e) {
48         if (root->s == s && root->e == e) return root->sum;
49         else {
50             int m = root->s + (root->e - root->s) / 2;
51             if (e <= m) return sumRange(root->left, s, e);
52             else if (s >= m + 1) return sumRange(root->right, s, e);
53             else return sumRange(root->left, s, m) + sumRange(root->right, m + 1, e);
54         }
55     }
56 };
57 
58 class NumArray {
59 public:
60     NumArray(vector<int>& nums) {
61         st = new SegmentTree(nums);
62     }
63 
64     void update(int i, int val) {
65         st->update(i, val);
66     }
67 
68     int sumRange(int i, int j) {
69         return st->sumRange(i, j);
70     }
71 private:
72     SegmentTree* st;
73 };
74 
75 
76 // Your NumArray object will be instantiated and called as such:
77 // NumArray numArray(nums);
78 // numArray.sumRange(0, 1);
79 // numArray.update(1, 10);
80 // numArray.sumRange(1, 2);