【leetcode】区域和检索 - 数组不可变

 

typedef int NumArray;

NumArray* numArrayCreate(int* nums, int numsSize) {
    for (int i = 1; i < numsSize; i++) {
        nums[i] += nums[i - 1];
    }
    return nums;
}

int numArraySumRange(NumArray* obj, int i, int j) {
    if (i == 0) return obj[j];
    
    return obj[j] - obj[i - 1];
}

void numArrayFree(NumArray* obj) {
    return;
}