HTMLify
Day 79
Views: 2 | Author: djdj
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 | int search(int* nums, int numsSize, int target) { int lb=0, ub=numsSize-1, mid; while(lb<=ub){ mid = (lb+ub)/2; if(nums[mid]==target){ return mid; } else if(nums[mid]>target){ ub=mid-1; } else{ lb=mid+1; } } return -1; } |