problem0307

README

307. Range Sum Query - Mutable

题目

Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive.

The update(i, val) function modifies nums by updating the element at index i to val.

Example:

Given nums = [1, 3, 5]

sumRange(0, 2) -> 9
update(1, 2)
sumRange(0, 2) -> 8

Note:

1. The array is only modifiable by the update function.
2. You may assume the number of calls to update and sumRange function is distributed evenly.

Documentation

Index

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

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

func (*NumArray) Update

func (this *NumArray) Update(i int, val int)

type SegmentTreeNode

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

https://leetcode.com/problems/range-sum-query-mutable/discuss/75724/17-ms-Java-solution-with-segment-tree