LeetCode - 303 区域和检索 - 数组不可变 (设计 前缀和数组）

class NumArray {
    
    private int[] preSum;
    public NumArray(int[] nums) {
    
       int n = nums.length;
       preSum = new int[n+1];
       for(int i = 0; i < n;i++)
         preSum[i+1] = preSum[i] + nums[i];
    }
    
    public int sumRange(int left, int right) {
    
         return preSum[right+1] - preSum[left];
    }
}