704. 二分查找 C++

class Solution {
public:
    int search(vector<int>& nums, int target) {
        int head = 0, tail = nums.size() - 1;
        while(head <= tail){
            int mid = head + (tail-head)/2;
            if(nums[mid] == target){
                return mid;
            }else if(nums[mid] > target ){
                tail = mid - 1;
            }else{
                head = mid + 1;
            }
        }
        return -1;
    }
};

重新开始刷力扣，至少保持一天一道的频率。希望能从科软顺利毕业，找到理想的工作。