leetCode/lc_33.cpp at master · llamazing/leetCode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
class Solution {
public:
    int search(vector<int>& nums, int target) {

		if( nums.size() < 1)
			return -1;
		int s = 0, e = nums.size() - 1, mid;
		if( nums.size() == 1)
           return nums[0] == target ? 0 :  -1;
		while( s <= e)
		{
			mid = ( e - s)/2 + s;
			if( nums[mid] == target)
				return mid;
			if( nums[s] == target)
				return s;
			if( nums[e] == target)
				return e;

			if( nums[s] < nums[e])
			{
				if( nums[mid] < target )
				{
					s = mid + 1;
					continue;
				}
				else
				{
					e = mid - 1;
					continue;
				}
			}
			else
			{
				if( nums[s] < nums[mid])
				{
					if( nums[s] < target && target < nums[mid])
					{
						e = mid -1;
						continue;
					}
					else
					{
						s = mid + 1;
						continue;
					}
				}
				else
				{
					if( nums[e] > target && target > nums[mid])
					{
						s = mid + 1;
						continue;
					}
					else
					{
						e = mid - 1;
						continue;
					}
				}
			}
		}

		return -1;

    }
};

/**
*
*Search in Rotated Sorted Array
*/2 == >>1
*/