Leetcode_c/033_search_in_rotated_sorted_array.c at master · jiajunhit/Leetcode_c · 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
#include <stdio.h>

int search(int* nums, int numsSize, int target) {
    if (target == nums[0]) {
        return 0;
    }

    int i;

    for (i = 1; i < numsSize; i++) {
        if (nums[i] == target) {
            return i;
        }

        if (nums[i] < nums[i-1]) {
            if (target > nums[i-1]) {
                return -1;
            }

            break;
        }
    }

    for ( ; i < numsSize; i++) {
        if (nums[i] == target) {
            return i;
        }

        if (nums[i] > target) {
            return - 1;
        }
    }

    return -1;
}

int main() {

    return 0;
}