problem303

README

< Previous 　　　　　　　　　　　　　　　　 Next >

303. Range Sum Query - Immutable (Easy)

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.

Related Topics

[Dynamic Programming]

Similar Questions

1. Range Sum Query 2D - Immutable (Medium)
2. Range Sum Query - Mutable (Medium)
3. Maximum Size Subarray Sum Equals k (Medium)

Documentation

Index

• type NumArray
  • func Constructor(nums []int) NumArray
  • func (this *NumArray) SumRange(i int, j int) int

Types

type NumArray

type NumArray struct {
	// contains filtered or unexported fields
}

func Constructor

func Constructor(nums []int) NumArray

func (*NumArray) SumRange

func (this *NumArray) SumRange(i int, j int) int