本文共 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;iarr[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);*/
转载地址:http://hwqvf.baihongyu.com/