Java for Leetcode 081 Search in rotated Sorted Array II

Follow to "Search in rotated Sorted Array":
What if duplicates is allowed?

Would this affect the run-time complexity? How and why?

Write a function to determine if a given the target was in the array.

Problem Solving Ideas:

Refer to Java for Leetcode 033 Search in rotated Sorted Array to modify the following code, Java implementation is as follows:

    public boolean search (int[] nums, int target) {int left = 0, right = Nums.length-1;while (left <= right) {if (target = = nums[(r + left)/2]) return true;//the right half is the rotation area if (nums[(right + left)/2] > Nums[left]) {if (Target >= nums[l EFT] && Target < nums[(right + left)/2]) Right = (right + left)/2-1;elseleft = (right + left)/2 + 1;}  The left half is the rotation area else if (nums[(right + left)/2] < Nums[left]) {if (Target > nums[(right + left)/2] && target <= Nums[right]) left = (right + left)/2 + 1;elseright = (right + left)/2-1;} to honestly traverse elseleft++;} return false;    }

Java for Leetcode 081 Search in rotated Sorted Array II