Time: 0 ms (100%), Space: 45.1 MB (55.08%) - LeetHub

Author: MukulParasar

0081-search-in-rotated-sorted-array-ii/0081-search-in-rotated-sorted-array-ii.java

@@ -0,0 +1,69 @@
+class Solution {
+    public boolean search(int[] nums, int target) {
+        if (nums.length == 1) {
+            return nums[0] == target;
+        }
+        int pivot = findPivotWithDuplicates(nums);
+        if (pivot == -1) {
+            // run normal binary search
+            return binarySearch(nums, target, 0, nums.length - 1);
+        }
+
+        // if pivot is found, two ascending sorted arrays found -> check if pivot is target. Otherwise, run binary search in each(separately)
+        if (nums[pivot] == target) {
+            return true;
+        }
+        if (target >= nums[0]) {
+            return binarySearch(nums, target, 0, pivot - 1);
+        } else {
+            return binarySearch(nums, target, pivot + 1, nums.length - 1);
+        }
+    }
+
+    boolean binarySearch(int[] arr, int target, int start, int end) {
+        while(start <= end) {
+            // find the middle element
+//            int mid = (start + end) / 2; // might be possible that (start + end) exceeds the range of int in java
+            int mid = start + (end - start) / 2;
+            if (target < arr[mid]) {
+                end = mid - 1;
+            } else if (target > arr[mid]) {
+                start = mid + 1;
+            } else {
+                // ans found
+                return true;
+            }
+        }
+        return false;
+    }
+
+    int findPivotWithDuplicates(int[] arr) {
+        int start = 0;
+        int end = arr.length - 1;
+        while (start <= end) {
+            int mid = start + (end - start) / 2;
+            if (mid < end && arr[mid] > arr[mid + 1]) {
+                return mid;
+            }
+            if (mid > start && arr[mid - 1] > arr[mid]) {
+                return mid - 1;
+            }
+            if (start < end && arr[start] == arr[mid] && arr[mid] == arr[end]) {
+                if (arr[start] > arr[start + 1]) {
+                    return start;
+                }
+                start++;
+                if (arr[end - 1] > arr[end]) {
+                    return end - 1;
+                }
+                end--;
+            }
+            else if (arr[start] < arr[mid] || (arr[start] == arr[mid] && arr[mid] > arr[end])) {
+                start = mid + 1;
+            } else {
+                end = mid - 1;
+            }
+        }
+        return -1;
+    }
+}