标签：code ica value target des output arch where bsp
You may assume no duplicates in the array.
Example 1:
Input: [1,3,5,6], 5 Output: 2
Example 2:
Input: [1,3,5,6], 2 Output: 1
Example 3:
Input: [1,3,5,6], 7 Output: 4
Example 4:
Input: [1,3,5,6], 0 Output: 0
1 class Solution { 2 public int searchInsert(int[] nums, int target) { 3 int n = nums.length; 4 int lo = 0; 5 int hi = n-1; 6 while(lo<=hi){ 7 int mid = lo+(hi-lo)/2; 8 if(nums[mid]>target) 9 hi = mid - 1; 10 else if (nums[mid]<target) 11 lo = mid + 1; 12 else 13 return mid; 14 } 15 return lo; 16 } 17 }
35. Search Insert Position(二分查找)
标签：code ica value target des output arch where bsp
原文地址：https://www.cnblogs.com/zle1992/p/8987874.html
