leetcode 解题思路

For aMaximum Segment Tree, which each node has an extra valuemaxto store the maximum value in this node's interval.Implement amodifyfunction with three parameterroot,indexandvalueto change the node's value with[start, end] = [index, index]to ...

For an integer array (index from 0 to n-1, where n is the size of this array), in the corresponding SegmentTree, each node stores an extra attributemaxto denote the maximum number in the interval of the array (index from start to end).Design aqueryme...

The structure of Segment Tree is a binary tree which each node has two attributesstartandenddenote an segment / interval.startandendare both integers, they should be assigned in following rules:The root'sstartandendis given bybuildmethod....

1. 模板2. 模板3. 模板

Given an integer arraynums, and then you need to implement two functions:update(i, val)Modify the element whose index is i to val. sumRange(l, r)Return the sum of elements whose indexes are in r...

You are given an integer array nums and you have to return a new counts array. The counts array has the property where counts[i] is the number of smaller elements to the right of nums[i].ExampleEx...

Give you an integer array (index from 0 to n-1, where n is the size of this array, data value from 0 to 10000) . For each elementAiin the array, count the number of element before this elementAiis...

Give you an integer array (index from 0 to n-1, where n is the size of this array, value from 0 to 10000) and an query list. For each query, give you an integer, return the number of element in the ar...

Given an integer array in the construct method, implement two methodsquery(start, end)andmodify(index, value):For query(start,end), return thesumfrom indexstartto indexendin the given arra...

Given an integer array (index from 0 to n-1, where n is the size of this array), and an query list. Each query has two integers[start, end]. For each query, calculate the sum number between index sta...