leetcode 35. Search Insert Position

标签：

Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in 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

[Solution]

二分法，搜索结束时，A[left] >= target, A[right] < target.

返回left即可.

 1 int searchInsert(int A[], int n, int target) 
 2     {
 3         int left = 0, right = n - 1, middle;
 4         
 5         while (left <= right)
 6         {
 7             middle = (left + right) / 2;
 8             if (A[middle] < target)
 9                 left = middle + 1;
10             else
11                 right = middle - 1;
12         }
13         
14         return left;
15     }

leetcode 35. Search Insert Position

标签：

原文地址：http://www.cnblogs.com/ym65536/p/4276014.html