307 solved

[zwfang]

/*
307. Range Sum Query - Mutable
https://leetcode.com/problems/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.

Note:
The array is only modifiable by the update function.
You may assume the number of calls to update and sumRange function is distributed evenly.
*/
// time: 2019-01-29
// 线段树时间复杂度为：O(log n)

[codecov]

Codecov Report

Merging #71 into master will increase coverage by 0.02%.
The diff coverage is 100%.

@@            Coverage Diff             @@
##           master      #71      +/-   ##
==========================================
+ Coverage   99.31%   99.33%   +0.02%     
==========================================
  Files         110      111       +1     
  Lines        1884     1926      +42     
==========================================
+ Hits         1871     1913      +42     
  Misses          9        9              
  Partials        4        4

Impacted Files	Coverage Δ
...307_Range_Sum_Query_Mutable/range_sum_query_mut.go	100% <100%> (ø)