Breaking News: Grepper is joining You.com. Read the official announcement!

search in rotated sorted array leetcode

Prabhu Kiran Konda answered on January 12, 2022 Popularity 10/10 Helpfulness 2/10

answer search in rotated sorted array leetcode

search in rotated sorted array leetcode

Comment

class Solution {
    public int search(int[] nums, int target) {
        int pivot = FindPivot(nums);
        int a_pointer = 0;
        int b_pointer = nums.length-1;
        if (target >= nums[pivot] && target <= nums[b_pointer] ){
            a_pointer = pivot;
        }else{
            b_pointer = pivot;
        }
        if (nums[a_pointer] == target) return a_pointer;
        if (nums[b_pointer] == target) return b_pointer;
        while(a_pointer <= b_pointer){
            int midpoint = a_pointer + (b_pointer - a_pointer) / 2;
            if (nums[midpoint] == target) return midpoint;
            if (nums[midpoint] < target) a_pointer = midpoint + 1;
            if (nums[midpoint] > target) b_pointer = midpoint - 1;
        }
        return -1;
    }
    
    public static int FindPivot(int[] nums){

        int start = 0;
        int end = nums.length-1;

        while (start < end){
            int mid = start + (end-start)/2;
            if (nums[mid] > nums[end]){
                start = mid+1;
            }else end = mid;
        }
        return start;
    }
}

Popularity 10/10 Helpfulness 2/10 Language java

Source: Grepper

Tags: java search

Link to this answer
Share Copy Link

Contributed on Jan 12 2022

Prabhu Kiran Konda

0 Answers Avg Quality 2/10

search in rotated sorted array leetcode

Contents

More Related Answers

search in rotated sorted array leetcode

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.