Given a sorted array `nums` and a `target`, implement `searchInsert(nums, target)` returning the index where target is, or where it would be inserted to keep the array sorted.
+ 1 hidden test run on Submit.
A lower-bound binary search finds the index or insertion point in O(log n).
Run your code to see results.