Skip to content

Latest commit

 

History

History
43 lines (28 loc) · 1.47 KB

0303-range-sum-query-immutable.adoc

File metadata and controls

43 lines (28 loc) · 1.47 KB

303. Range Sum Query - Immutable

{leetcode}/problems/range-sum-query-immutable/[LeetCode - 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.

思路分析

前缀和

{image_attr} 
link:{sourcedir}/_0303_RangeSumQueryImmutable.java[role=include]