search insert position

1 class Solution {
 2 public:
 3     int searchInsert(int A[], int n, int target) {
 4         // Start typing your C/C++ solution below
 5         // DO NOT write int main() function
 6         int lt = 0, rt = n-1;
 7         while(lt <= rt )
 8         {
 9             int mid = (lt + rt )/2;
10             if( A[mid] == target )
11                 return mid;
12             else if( A[mid] > target )
13                 rt = mid - 1;
14             else 
15                 lt = mid + 1;
16         }
17         return lt;
18     }
19 };

原文链接: https://www.cnblogs.com/jumpinGGrass/p/3169937.html

欢迎关注

微信关注下方公众号，第一时间获取干货硬货；公众号内回复【pdf】免费获取数百本计算机经典书籍