Create searchInPivotedArrayJava

https://leetcode.com/problems/search-in-rotated-sorted-array/

Author: striver79

searchInPivotedArrayJava

@@ -0,0 +1,28 @@
+class Solution {
+    public int search(int[] a, int target) {
+        int low = 0, high = a.length - 1; 
+        while(low <= high) {
+            int mid = (low + high) >> 1; 
+            if(a[mid] == target) return mid; 
+            
+            // the left side is sorted
+            if(a[low] <= a[mid]) {
+                if(target >= a[low] && target <= a[mid]) {
+                    high = mid - 1; 
+                }
+                else {
+                    low = mid + 1; 
+                }
+            }
+            else {
+                if(target >= a[mid] && target <= a[high]) {
+                    low = mid + 1; 
+                }
+                else {
+                    high = mid - 1; 
+                }
+            }
+        } 
+        return -1; 
+    }
+}