Data Structures, Algorithms, Leetcode, Segment Tree, Programming.
minimum absolute difference of the subarray nums[li...ri] containing the elements of nums between the 0-based indices li and ri (inclusive). Return an array ans where ans[i] is the answer to the ith query. The value of |x| is defined as: x if x >= 0. x if x < 0. Example 1: Input: nums = [1,3,4,8],