LeetCode:Search Insert Position

标签：style   blog   color   io   os   ar   for   div   sp   

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

 1 class Solution {
 2     public:
 3         int searchInsert(int A[],int n,int target)  {
 4             int index=0;
 5             int i;
 6             for(i=0;i<n;i++)
 7             {
 8                 if(target>A[i])
 9                     index++;
10                 else
11                     break;
12             }
13             return index;
14         }
15 };

LeetCode:Search Insert Position

标签：style   blog   color   io   os   ar   for   div   sp   

原文地址：http://www.cnblogs.com/levicode/p/3967230.html