LeetCode-Easy部分中标签为Dynamic Programming 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.

题目分析

求 [i,j] 区域和。这个题目最出彩的地方莫过于给出了一个构造函数，这是一个重要的提示，预示着它可能给出点什么东西。是的，在构造函数中，计算出 nums[i] = nums[0]~nums[i]的和。

代码实现

public class NumArray {

    private int[] _nums;
    public NumArray(int[] nums) {
        _nums = nums;
        for(int i=1;i<_nums.Length;i++)
          _nums[i]+=_nums[i-1];
    }

    public int SumRange(int i, int j) {
        if(i==0)
          return _nums[j];

        return _nums[j] - _nums[i-1];
    }
}

/**
 * Your NumArray object will be instantiated and called as such:
 * NumArray obj = new NumArray(nums);
 * int param_1 = obj.SumRange(i,j);
 */