Search in Rotated Sorted Array II - LeetCode

Problem Link C++ Code class Solution { public: bool search(vector<int>& nums, int target) { int low = 0, high = nums.size()-1; while(low <= high) { int mid = low + (high-low)/2; if(nums[mid] == target) ...