303. Range Sum Query – Immutable(easy)

Easy

537837FavoriteShare

Given an integer array nums, find the sum of the elements between indices iand 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.

 

一维存储作差法：

Java：

/*
 * @Author: SourDumplings 
 * @Date: 2019-09-10 08:25:00 
 * @Last Modified by: SourDumplings
 * @Last Modified time: 2019-09-10 08:27:49
 */
class NumArray
{
    private int[] res;

    public NumArray(int[] nums)
    {
        int l = nums.length;
        res = new int[l];
        if (l > 0)
        {
            res[0] = nums[0];
        }
        for (int i = 1; i < l; i++)
        {
            res[i] = res[i - 1] + nums[i];
        }
    }

    public int sumRange(int i, int j)
    {
        if (i == 0)
        {
            return res[j];
        }
        else
            return res[j] - res[i - 1];
    }
}

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

二维存储法：

C++：

 

/*
 * @Author: SourDumplings 
 * @Date: 2019-09-09 23:04:39 
 * @Last Modified by: SourDumplings
 * @Last Modified time: 2019-09-09 23:04:59
 */

class NumArray
{
private:
    static const int MAXN = 10000;
    int res[MAXN][MAXN];

public:
    NumArray(vector<int> &nums)
    {
        int l = nums.size();
        for (int i = 0; i < l; i++)
        {
            res[i][i] = nums[i];
            for (int j = i + 1; j < l; j++)
            {
                res[i][j] = res[i][j - 1] + nums[j];
            }
        }
    }

    int sumRange(int i, int j)
    {
        return res[i][j];
    }
};

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