leetcode解题之303# Range Sum Query - Immutable Java版 (多次计算数组内任意两个下标之间的和)
303.RangeSumQuery-ImmutableGivenanintegerarraynums,findthesumoftheelementsbetweenindicesiandj(i≤j),inclusive.Example:Givennums=[-2,0,3,-5,2,-1]sumRange(0,2)->1sumRange(2,5)->-1sumRange(0,5)->-3Note:Yo