第五周：35. Search Insert Position

Given a sorted array and a target value, return the index if thetarget is found. If not, return the index where it would be if it were insertedin order.

You may assume no duplicates in the array.

Here are few examples. [1,3,5,6], 5→ 2 [1,3,5,6], 2→ 1 [1,3,5,6], 7→ 4 [1,3,5,6], 0→ 0

主要思想是二分查找的思想。

int searchInsert(vector<int>&nums, int target) { int low = 0, high = nums.size()-1; while (low <= high) { int mid = (high+low)/2; if (nums[mid] < target) low = mid+1; else high = mid-1; } return low; }