704. Binary Search

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