leetcode - Search in Rotated Sorted Array II

class Solution {
public:
bool search(int A[], int n, int target) {
// IMPORTANT: Please reset any member data you declared, as
// the same Solution instance will be reused for each test case.
if (n<=0) // cannot decide which side target should be, so O(n)
return -1;
for (int i=0; i<n; i++)
if (A[i]==target)
return true;
return false;
}
};