Leetcode307. 区域和检索 - 数组可修改(C语言)
题目:
给定一个整数数组 nums,求出数组从索引 i 到 j (i ≤ j) 范围内元素的总和,包含 i, j 两点。update(i, val) 函数可以通过将下标为 i 的数值更新为 val,从而对数列进行修改。例:
输入:[“NumArray”,“sumRange”,“update”,“sumRange”]
[[[1,3,5]],[0,2],[1,2],[0,2]]
输出:[null,9,null,8]
思路:
法1:暴力。由于需要改变,故不能将累加和放进NumArray中,在sumRange累加。
法2:线段树
代码:
typedef struct {
int a;
int val[];
} NumArray;
NumArray* numArrayCreate(int* nums, int numsSize) {
NumArray* obj=(NumArray*)malloc(sizeof(NumArray)+(sizeof(int)*numsSize));
for(int i=0;i<numsSize;i++){
obj->val[i]=nums[i];
}
return obj;
}
void numArrayUpdate(NumArray* obj, int i, int val) {
obj->val[i]=val;
}
int numArraySumRange(NumArray* obj, int i, int j) {
int sum=0;
for(int n=i;n<=j;n++){
sum+=obj->val[n];
}
return sum;
}
void numArrayFree(NumArray* obj) {
free(obj);
}
/**
* Your NumArray struct will be instantiated and called as such:
* NumArray* obj = numArrayCreate(nums, numsSize);
* numArrayUpdate(obj, i, val);
* int param_2 = numArraySumRange(obj, i, j);
* numArrayFree(obj);
*/