Dashboard Temp Share Shortlinks Frames API

HTMLify

LeetCode - Range Sum Query - Immutable - C
Views: 2 | Author: abh
 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
#include <stdlib.h>
// @leet start



typedef struct {
    int *nums;
} NumArray;


NumArray* numArrayCreate(int* nums, int numsSize) {
    NumArray *na = malloc(sizeof(NumArray));
    na->nums = malloc(sizeof(int)*numsSize);
    for (int i = 0; i < numsSize; i++) {
        na->nums[i] = nums[i];
    }
    return na;
}

int numArraySumRange(NumArray* na, int left, int right) {
    int sum = 0, i;
    for (i = left; i <= right; i++) {
        sum += na->nums[i];
    }
    return sum;
}

void numArrayFree(NumArray* na) {
    free(na->nums);
    free(na);
}

/**
 * Your NumArray struct will be instantiated and called as such:
 * NumArray* obj = numArrayCreate(nums, numsSize);
 * int param_1 = numArraySumRange(obj, left, right);
 
 * numArrayFree(obj);
*/
// @leet end