https://leetcode.com/problems/search-in-rotated-sorted-array-ii/description/ Follow up for "Search in Rotated Sorted Array": What if duplicates are allowed? Would this affect the run-time complexity? How and why? Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand. (i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2). Write a function to determine if a given target is in the array. make sure also checks the

1 public boolean search(int[] nums, int target) { 2         if (nums == null || nums.length ==0 ) return false ; 3         int left = 0, right = nums.length - 1 ; 4         while (left + 1 < right){ 5             int mid = left + (right - left) /2 ; 6             if (nums[mid] == target) return true; 7             /*when left == mid or mid == right this will not provide any useful info(could not determine the range) 8              */ 9             if (nums[left] == nums[mid] ){10                 left ++ ;11             }12             if (nums[mid] == nums[right]){13                 right--;14             }15             //upper part16             if (nums[left]