leetcode 33. Search in Rotated Sorted Array (medium)

ccczxacxzxcz

于 2019-07-08 14:54:01 发布

阅读量92

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/ruohua3kou/article/details/95060552

版权

leetcode 专栏收录该内容

152 篇文章 0 订阅

订阅专栏

时间要求 O(log n)
看代码就好

class Solution
{
public:
	int search(vector<int> &nums, int target)
	{
		int left = 0;
		int right = nums.size() - 1;
		while (left <= right)
		{
			int mid = left + (right - left) / 2;
			if (target == nums[mid])
				return mid;
			if (nums[mid] >= nums[left])
			{
				// 左边已排序
				if (target < nums[mid] && target >= nums[left])
					right = mid - 1;
				else
					left = mid + 1;
			}
			else
			{
				// 右边已排序
				if (target > nums[mid] && target <= nums[right])
					left = mid + 1;
				else
					right = mid - 1;
			}
		}
		return -1;
	}
};