Leetcode 303. Range Sum Query - 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]

sumRange(0, 2) -> 1
sumRange(2, 5) -> -1
sumRange(0, 5) -> -3

 

Note:

  1. You may assume that the array does not change.
  2. There are many calls to sumRange function.

Solution: Because "There are many calls to sumRange Function", we need to put the loop inside the constructor, but not the SumRange() method, otherwise there will be "Time Limit Exceeded" problem.

Dynamic programing to calculate all sums for 0 to nums.Length-1, then if i to j,

return sumAt(j) -sumAt(i-1) when i>0;

return sumAt(j) when i==0;

 1 public class NumArray {
 2     private int[] dp {get;set;}
 3     public NumArray(int[] nums) {
 4         int l = nums.Length;
 5         if(l>0)
 6         {
 7             dp = new int[l];
 8             dp[0]=nums[0];
 9 
10             for(int k=1; k<nums.Length; k++)
11             {
12                 dp[k]=dp[k-1]+nums[k];
13             }
14         }
15         
16     }
17 
18     public int SumRange(int i, int j) {
19         if(i>0)
20         {
21             return dp[j]-dp[i-1];
22         }
23         else
24         return dp[j];
25     }
26 }
27 
28 
29 // Your NumArray object will be instantiated and called as such:
30 // NumArray numArray = new NumArray(nums);
31 // numArray.SumRange(0, 1);
32 // numArray.SumRange(1, 2);

 

转载于:https://www.cnblogs.com/MiaBlog/p/6041347.html

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值