Search in Rotated Sorted Array

medium

Acceptance: 42%

Binary Search

An ascending sorted array of distinct integers was rotated at some unknown pivot. Given the rotated array and a target value, find the index of the target or return -1 if it is absent. Your solution must run in O(log n) time.

Examples

Example 1:

Input:nums = [5,6,7,1,2,3,4], target = 3

Output:5

Explanation: The value 3 sits at index 5 in the rotated array.

Example 2:

Input:nums = [5,6,7,1,2,3,4], target = 8

Output:-1

Explanation: 8 does not appear in the array.

Hints

1234567

import java.util.*;

public class Main {
    public static void main(String[] args) {
        // Write your solution here
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        // Write your solution here
    }
}

Search in Rotated Sorted Array

Examples

Hints

Related Problems