【LeetCode-303】Range Sum Query - Immutable

最新推荐文章于 2022-10-26 15:00:30 发布

cold2wind

最新推荐文章于 2022-10-26 15:00:30 发布

阅读量251

点赞数

分类专栏： leetcode 文章标签： LeetCode-303 Range Sum Query - Im

本文链接：https://blog.csdn.net/cold2wind/article/details/50849335

版权

leetcode 专栏收录该内容

80 篇文章 0 订阅

订阅专栏

Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive

给定一个数组nums，求出索引i和j之间元素的和，i一定是小于或等于j的(包含i和j)

Example:

Given nums = [-2, 0, 3, -5, 2, -1]

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

package leetcode;

public class RangeSumQueryImmutable {
	
	public int[] sum;
	public void NumArray(int[] nums) {
		if(nums == null || nums.length == 0){
			sum = null;
		}
	
		else{
			sum = new int[nums.length];
			sum[0] = nums[0];
			for(int i = 1;i < nums.length;i ++){
				sum[i] = sum[i - 1] + nums[i];
			}
		}
    }

    public int sumRange(int i, int j) {
    	if(sum == null || j >= sum.length){
    		return 0;
    	}
    	if(i == 0){
    		return sum[j];
    	}
    	else{
    		return sum[j] - sum[i - 1];
    	}
    }
}