303. Range Sum Query
来源:互联网 发布:尤克里里谱软件 编辑:程序博客网 时间:2024/06/05 14:16
Given an integer array nums, find the sum of the elements between indicesi and j (i ≤ j), inclusive.
Example:
Given nums = [-2, 0, 3, -5, 2, -1]sumRange(0, 2) -> 1sumRange(2, 5) -> -1sumRange(0, 5) -> -3
Note:
- You may assume that the array does not change.
- There are many calls to sumRange function.
代码:
class NumArray {
int[] arrays;
public NumArray(int[] nums) {
arrays=new int[nums.length+1];
int sum=0;
for(int i=0;i<nums.length;i++)
{
arrays[i]=sum;
sum+=nums[i];
}
arrays[nums.length]=sum;
}
public int sumRange(int i, int j) {
return arrays[j+1]-arrays[i];
}
}
阅读全文
0 0
- 303. Range Sum Query
- 303. Range Sum Query
- 303. Range Sum Query
- 303. Range Sum Query
- 303. Range Sum Query
- 303. Range Sum Query
- 303. Range Sum Query
- 303. Range Sum Query
- 303. Range Sum Query
- 303. Range Sum Query
- 303. Range Sum Query
- 303. Range Sum Query
- 303. Range Sum Query
- 303. Range Sum Query
- 303. Range Sum Query
- 303. Range Sum Query
- 303. Range Sum Query
- 303. Range Sum Query
- 欢迎使用CSDN-markdown编辑器
- UVA 10891
- 安卓客户端和服务器端的通信(勘误填坑版)
- 封装
- Activity和fragment的封装
- 303. Range Sum Query
- 网络判断,返回设置页面
- Angularjs敏感字符
- svn提交遇到冲突解决方法
- 购物车案列
- 促其长谈之插入排序和希尔排序
- MySql多表联查
- Spring注解@Resource和@Autowired区别对比
- 指针和引用