leetcode

Problem description

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:

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

Name		Name	Last commit message	Last commit date
parent directory ..
basic-calculator-ii		basic-calculator-ii
binary-tree-level-order-traversal		binary-tree-level-order-traversal
binary-tree-zigzag-level-order-traversal		binary-tree-zigzag-level-order-traversal
combination-sum		combination-sum
compare-version-numbers		compare-version-numbers
contains-duplicate		contains-duplicate
duplicate-emails		duplicate-emails
excel-sheet-column-number		excel-sheet-column-number
flatten-binary-tree-to-linked-list		flatten-binary-tree-to-linked-list
largest-number		largest-number
longest-palindromic-substring		longest-palindromic-substring
maximum-product-subarray		maximum-product-subarray
path-sum-ii		path-sum-ii
permutations-ii		permutations-ii
permutations		permutations
range-sum-query-2d-immutable		range-sum-query-2d-immutable
reverse-word-in-a-string		reverse-word-in-a-string
rotate-image		rotate-image
transpose-file		transpose-file
valid-sudoku		valid-sudoku
README.md		README.md
solution.py		solution.py