303. 区域和检索 - 数组不可变
class NumArray {
private int[] arr;
public NumArray(int[] nums) {
final int n = nums.length;
arr = new int[n];
arr[0] = nums[0];
for (int i = 1; i < n; i ++) {
arr[i] = arr[i - 1] + nums[i];
}
}
public int sumRange(int left, int right) {
if (0 == left) {
return arr[right];
} else {
return arr[right] - arr[left - 1];
}
}
}