整数数组
nums
按升序排列,数组中的值 互不相同 。在传递给函数之前,
nums
在预先未知的某个下标k
(0 <= k < nums.length
)上进行了 旋转,使数组变为[nums[k], nums[k+1], ..., nums[n-1], nums[0], nums[1], ..., nums[k-1]]
(下标 从 0 开始 计数)。例如,[0,1,2,4,5,6,7]
在下标3
处经旋转后可能变为[4,5,6,7,0,1,2]
。给你 旋转后 的数组
nums
和一个整数target
,如果nums
中存在这个目标值target
,则返回它的下标,否则返回-1
。你必须设计一个时间复杂度为
O(log n)
的算法解决此问题。示例 1:
输入:nums = [4,5,6,7,0,1,2]
, target = 0 输出:4示例 2:
输入:nums = [4,5,6,7,0,1,2]
, target = 3 输出:-1示例 3:
输入:nums = [1], target = 0 输出:-1提示:
1 <= nums.length <= 5000
-104 <= nums[i] <= 104
nums
中的每个值都 独一无二- 题目数据保证
nums
在预先未知的某个下标上进行了旋转-104 <= target <= 104
这道题我的想法是这样的,要求时间复杂度为 O(log n)
,首先想到二分算法。
首先找中点,中点必将当前数组分为常规递增数组,和一个题目的旋转排序数组,然后判断一下target在哪个数组,继续递归搜索即可。
0ms击败100%
class Solution {
public:
int erfs(vector<int>& nums, int left, int right, int target) {
if (left == right) {
return nums[left] == target ? left : -1;
}
if (left + 1 == right) {
int k = -1;
if (nums[left] == target) k = left;
if (nums[right] == target) k = right;
return k;
}
int mid = (left + right) / 2, res;
if (target > nums[mid]) res = erfs(nums, mid, right, target);
else res = erfs(nums, left, mid, target);
return res;
}
int dfs(vector<int>& nums, int left, int right, int target) {
if (left == right) {
return nums[left] == target ? left : -1;
}
if (left + 1 == right) {
int k = -1;
if (nums[left] == target) k = left;
if (nums[right] == target) k = right;
return k;
}
int mid = (left + right) / 2, res;
if (nums[mid] > nums[left]) {
if (target > nums[mid] || target < nums[left]) {
res = dfs(nums, mid, right, target);
}
else {
res = erfs(nums, left, mid, target);
}
}
else {
if (target < nums[mid] || target > nums[right]) {
res = dfs(nums, left, mid, target);
}
else {
res = erfs(nums, mid, right, target);
}
}
return res;
}
int search(vector<int>& nums, int target) {
return dfs(nums, 0, nums.size() - 1, target);
}
};