int search(int nums[], int target) { int left = 0, right = sizeof(nums)/sizeof(nums[0]) - 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 -1;

}

把下面的代码改成c语言:public int searchint nums int target int left = 0 right = numslength - 1; whileleft = right int mid = left + right 2; ifnumsmid target

原文地址: http://www.cveoy.top/t/topic/bLwW 著作权归作者所有。请勿转载和采集!

免费AI点我,无需注册和登录