Time: 8 ms (15.38%), Space: 11.1 MB (73.42%) - LeetHub

Author: elixered

search-in-rotated-sorted-array/search-in-rotated-sorted-array.cpp

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