Data Structures, Algorithms, Leetcode, Segment Tree, Programming.
00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000011000 According to the bitset result, since it is already sorted naturally, we can use greedy algorithm to solve the Minimum Absolute Difference in one traversal. It is a bit similar to the idea of