请实现无重复数字的升序数组的二分查找
给定一个 元素升序的、无重复数字的整型数组 nums 和一个目标值 target ,写一个函数搜索 nums 中的 target,如果目标值存在返回下标(下标从 0 开始),否则返回 -1
using System;
using System.Collections.Generic;
class Solution {
public int search (List<int> nums, int target) {
if (nums == null || nums.Count == 0) return -1;
int left = 0;
int right = nums.Count - 1;
int mid = (left + right) / 2;
int flag = 0;
while (left <= right) {
mid = (left + right) / 2;
flag = nums[mid] - target;
if (flag == 0) return mid;
else if (flag > 0) right = mid - 1;
else left = mid + 1 ;
}
return -1;
}
}