[LintCode]Search in Rotated Sorted Array II
public class Solution {
/**
* param A : an integer ratated sorted array and duplicates are allowed
* param target : an integer to be search
* return : a boolean
*/
public boolean search(int[] A, int target) {
// 2015-4-7 时间复杂度最快是O(n)
for (int i = 0; i < A.length; i++) {
if (A[i] == target) {
return true;
}
}
return false;
}
}