Gyh's Braindump
BinarySearch
tags
Algorithm
when computing pivot, use
low + (high - low) // 2
to avoid overflow
Links to this note
222. Count Complete Tree Nodes
CN-03.Duplicate number in the array
CN-11. Find smallest number in the shifted array