标签：color while order where insert value sort cat target
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(vector<int>& nums, int target) { 4 int i = 0; 5 int j = nums.size() - 1; 6 int mid; 7 8 while (i < j){ 9 mid = (i + j) / 2; 10 if (nums[mid] == target){ 11 return mid; 12 } 13 14 if (target < nums[mid]){ 15 j = mid; 16 }else{ 17 i = mid + 1; 18 } 19 } 20 if (nums[i] < target) i++; 21 22 return i; 23 } 24 };
[LeetCode] 35. Search Insert Position
标签：color while order where insert value sort cat target
原文地址：http://www.cnblogs.com/amadis/p/6707990.html
