Range|Range Sum Query - Immutable RangeSumQuery-Immutable

Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive.
Example:
Given nums = [-2, 0, 3, -5, 2, -1]
【Range|Range Sum Query - Immutable】sumRange(0, 2) -> 1
sumRange(2, 5) -> -1
sumRange(0, 5) -> -3
Note:
You may assume that the array does not change.
There are many calls to sumRange function.
Careful of timeout.
struct NumArray { int size; int *sum; };
/** Initialize your data structure here. */
struct NumArray* NumArrayCreate(int* nums, int numsSize) { struct NumArray* numArray; numArray=(struct NumArray*)calloc(1,sizeof(struct NumArray)); numArray->sum=(int*)calloc(numsSize+1, sizeof(int)); numArray->size=numsSize; numArray->sum[0]=0; for(int i=0; isum[i+1]=numArray->sum[i]+nums[i]; return numArray; } int sumRange(struct NumArray* numArray, int i, int j) { int sum=0; if(!numArray) return 0; sum=numArray->sum[j+1]-numArray->sum[i]; return sum; } /** Deallocates memory previously allocated for the data structure. */ void NumArrayFree(struct NumArray* numArray) { free(numArray->sum); free(numArray); } // Your NumArray object will be instantiated and called as such: // struct NumArray* numArray = NumArrayCreate(nums, numsSize); // sumRange(numArray, 0, 1); // sumRange(numArray, 1, 2); // NumArrayFree(numArray);

Range|Range Sum Query - Immutable

推荐阅读

节节高升的寓意是什么

鸿蒙系统中文编程教程，华为鸿蒙系统怎么申请

中国财产保险公司排名中国财产保险车险电话

为啥说杭州碎尸案存在两个疑问？

煌精二材料是什么

酒店海尔空调显示f6处理方法与故障原因说明

mongodb导入数据三种方式 mongodb导入备份

弹幕视频软件安卓,快速制作视频软件包括lexiu软件

21天|21天 | 丢21天懒惰组合《目送》

微信站点网站分析

20篇精品文章+视频，手把手带你攻克OOM难题！｜HeapDump性能社区专题精选

辣妈最放心的宝宝面霜有什么？推荐几款安全的宝宝面霜

培训对象分析,GYB的培训对象是

癌肉瘤治疗方法

羊圈毛的衣服怎么清洗羊毛衣服怎样清洗

生活着

现在还有ios培训吗，上海腾科现在有ios培训吗

阳光下的我们歌词分享推荐

箭牌马桶真假鉴别如何分辨真假

马岱为什么杀魏延？关于马岱杀魏延的故事