---

• 題目連接：35. 搜索插入位置

---

1- 思路

二分

• 二分左區(qū)間的三種情況。
• 由于目標(biāo)值不一定在數(shù)組中，因此二分的過程中有三種情況判斷

---

2- 實現(xiàn)

?35. 搜索插入位置——題解思路

class Solution {public int searchInsert(int[] nums, int target) {int left = 0;int right = nums.length-1;while(left<=right){int mid = left + (right-left)/2;if(nums[mid]<target){left = mid+1;}else if(nums[mid] > target){right = mid-1;}else{return mid;}}return left;}
}

---

3- ACM 實現(xiàn)

public class searchIndex {public static int search(int[] nums,int target){int left = 0;int right = nums.length-1;while(left<=right){int mid = (left+right)/2;if(nums[mid]<target){left = mid+1;}else if(nums[mid] > target){right = mid-1;}else{return mid;}}return left;}public static void main(String[] args) {Scanner sc = new Scanner(System.in);String input = sc.nextLine();input = input.substring(1,input.length()-1);String[] parts = input.split(",");int[] nums = new int[parts.length];for(int i = 0 ; i < parts.length;i++){nums[i] = Integer.parseInt(parts[i]);}System.out.println("輸入target值");int target = sc.nextInt();System.out.println("結(jié)果是"+search(nums,target));}
}