Leetcode 704. Binary Search（二分查找）没有返回插入位置35

Binary Search
Given a sorted (in ascending order) integer array nums of n elements and
a target value, write a function to search target in nums. If target
exists, then return its index, otherwise return -1.
Example 1:
Input: nums = [-1,0,3,5,9,12], target = 9
Output: 4
Explanation: 9 exists in nums and its index is 4

class Solution {
    public int search(int[] nums, int target) {
        int size=nums.length;
        if(size==0){
            return -1;
        }
        int left=0;
        int right=size-1;
        while(left<=right){//left=right的时候继续循环，此时mid=left=right
            int mid=(left+right)/2;
            if(nums[mid]==target){
                return mid;
            }
            else if(nums[mid]<target){
                left=mid+1;
            }
            else{
                right=mid-1;
            }
        }
        return -1;
    }
}

没有就返回插入位置

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