本文共 1544 字，大约阅读时间需要 5 分钟。

原题题目

代码实现（首刷自解 暴力解法）

typedef struct {
       int size;    int* arr;} NumArray;NumArray* numArrayCreate(int* nums, int numsSize) {
       NumArray* obj = (NumArray*)malloc(sizeof(NumArray));    obj->size = numsSize;    obj->arr = (int*)malloc(sizeof(int) * numsSize);    memcpy(obj->arr,nums,sizeof(int) * numsSize);    return obj;}int numArraySumRange(NumArray* obj, int i, int j) {
       int temp,count = 0;    for(temp = i;temp <= j;temp++)        count+=obj->arr[temp];    return count;}void numArrayFree(NumArray* obj) {
       free(obj);}/** * Your NumArray struct will be instantiated and called as such: * NumArray* obj = numArrayCreate(nums, numsSize); * int param_1 = numArraySumRange(obj, i, j);  * numArrayFree(obj);*/

代码实现（首刷自解 改进版）

typedef struct {
       int size;    int* arr;} NumArray;NumArray* numArrayCreate(int* nums, int numsSize) {
       NumArray* obj = (NumArray*)malloc(sizeof(NumArray));    obj->size = numsSize;    obj->arr = (int*)malloc(sizeof(int) * numsSize);    int i;    for(i=0;i
   
    arr[i] = nums[i];        else            obj->arr[i] = obj->arr[i-1]+nums[i];    }    return obj;}int numArraySumRange(NumArray* obj, int i, int j) {
       int temp,count = 0;    if(i)        count = obj->arr[j] - obj->arr[i-1];    else        count = obj->arr[j];    return count;}void numArrayFree(NumArray* obj) {
       free(obj);}/** * Your NumArray struct will be instantiated and called as such: * NumArray* obj = numArrayCreate(nums, numsSize); * int param_1 = numArraySumRange(obj, i, j);  * numArrayFree(obj);*/
   

转载地址：https://love6.blog.csdn.net/article/details/112795468 如侵犯您的版权，请留言回复原文章的地址，我们会给您删除此文章，给您带来不便请您谅解！