题目传送地址:https://leetcode.cn/problems/search-in-rotated-sorted-array-ii/
运行效率
代码如下:
class Solution {
public boolean search(int[] nums, int target) {
for (int i = 0; i < nums.length; i++) {
if (nums[i] == target) {
return true;
}
}
return false;
}
}