977.有序数组的平方

public static int search1(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 -1;
    }