【leetcode】Search in Rotated Sorted Array II

What if duplicates are allowed?

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

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

class Solution {
public:
bool search(vector<int>& nums, int target) {
if(nums.size()==0) return false;

for(int i=0;i<nums.size();i++)
{
if(target==nums[i])
return true;
}
return false;
}
};