LeetCode之搜索旋转排序数组

介绍

假设按照升序排序的数组在预先未知的某个点上进行了旋转。( 例如，数组 [0,1,2,4,5,6,7] 可能变为 [4,5,6,7,0,1,2] )。搜索一个给定的目标值，如果数组中存在这个目标值，则返回它的索引，否则返回 -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

源代码：

class Solution {
public:
    int search(vector<int>& nums, int target) 
    {
        int start = 0, end = nums.size()-1;
        while(start <= end)
        {
            if(target == nums[start]) return start;
            if(target == nums[end]) return end;

            int middle = (start + end)/2;
            if(target == nums[middle])
                return middle;

            if(nums[start] > nums[middle])
            {
                if(target > nums[middle] && nums[start] > target)
                    start = middle + 1;
                else
                    end = middle - 1;
            } 
            else 
            {
                if(target < nums[middle] && target > nums[start])
                    end = middle - 1;
                else
                    start = middle + 1;
            }
        }
        return -1;
    }
};

除了这个简洁的，还有一个稍长的代码，基本思想是，首先确定在哪一个位置上进行旋转的，然后分成两部分，依次进行二分查找。

#include <iostream>
#include<vector>
#include<algorithm>

using namespace std;

int search(vector<int>& nums, int target)
{
	int left = 0;
	int right = nums.size() - 1;
	int middle;
	int tmp;

	if (nums.size() == 0)
	{
		return -1;
	}
	if (nums.size() == 1)
	{
		if (nums[0] == target) return 0;
		else return -1;
	}
	if (nums.size() == 2)
	{
		if (nums[0] == target) return 0;
		else if (nums[1] == target) return 1;
		else return -1;
	}
	
	for (int i = 0; i < nums.size()-1; i++)
	{
		if (nums[i] > nums[i + 1])
		{
			tmp = i+1;
		}
	}

	if (tmp!=NULL)
	{
		if (target <= nums[tmp - 1] && target >= nums[0])
		{
			left = 0;
			right = tmp - 1;
			while (left < right)
			{
				if (nums[left] == target)
				{
					return left;
				}
				else if (nums[right] == target)
				{
					return right;
				}
				middle = left+(right - left) / 2;
				if (nums[middle] == target)
				{
					return middle;
				}
				else if (nums[middle] > target)
				{
					right = middle;
				}
				else if (nums[middle] < target)
				{
					left = middle;
				}
			}
		}
		else if (target >= nums[tmp] && target <= nums[nums.size() - 1])
		{
			left = tmp;
			right = nums.size() - 1;
			while (left < right)
			{
				if (nums[left] == target)
				{
					return left;
				}
				else if (nums[right] == target)
				{
					return right;
				}
				middle = left + (right - left) / 2;
				if (nums[middle] == target)
				{
					return middle;
				}
				else if (nums[middle] > target)
				{
					right = middle;
				}
				else if (nums[middle] < target)
				{
					left = middle;
				}
			}
		}
	}
	else if (tmp == NULL)
	{
		cout << "cuiwei" << endl;
		left = 0;
		right = nums.size() - 1;
		while (left < right)
		{
			if (nums[left] == target)
			{
				return left;
			}
			else if (nums[right] == target)
			{
				return right;
			}
			middle = left + (right - left) / 2;
			if (nums[middle] == target)
			{
				return middle;
			}
			else if (nums[middle] > target)
			{
				right = middle;
			}
			else if (nums[middle] < target)
			{
				left = middle;
			}
		}
	}
	

	return -1;
}

int main()
{
	vector<int> nums = {1,3,5};
	int target = 1;
	int result = search(nums,target);
	cout << result << endl;
	system("pause");
	return 0;
}