标签：style blog http color strong os
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
解法一：线性查找(linear search)
class Solution { public: int searchInsert(int A[], int n, int target) { int low = 0; int high = n-1; int mid = (low+high)/2; while(low <= high) { if(A[mid] == target) return mid; else if(A[mid] > target) { high = mid-1; mid = (low+high)/2; } else { low = mid+1; mid = (low+high)/2; } } return low; } };
解法二：二分查找(binary search)
class Solution { public: int searchInsert(int A[], int n, int target) { int low = 0; int high = n-1; int mid = (low+high)/2; while(low <= high) { if(A[mid] == target) return mid; else if(A[mid] > target) { high = mid-1; mid = (low+high)/2; } else { low = mid+1; mid = (low+high)/2; } } return low; } };
【LeetCode】Search Insert Position (2 solutions),布布扣,bubuko.com
【LeetCode】Search Insert Position (2 solutions)
标签：style blog http color strong os
原文地址：http://www.cnblogs.com/ganganloveu/p/3834573.html
