/Java/Search in rotated sorted array leetcode

Search in rotated sorted array leetcode

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;
    }
}

Similar codes

1 vote170 views1 answer
Factorial java
Java
5 votes171 views2 answers
How to add a number to an array in java
Java
1 vote189 views2 answers
Overloading + operator in java
Java
1 vote182 views1 answer
Chenge font android studio
Java
4 votes182 views4 answers
Hello word java
Java
0 vote181 views1 answer
Mobile number validation in android
Java
0 vote169 views1 answer
If statements not working java
Java
1 vote201 views1 answer
Return boolean value from stream
Java
0 vote193 views1 answer
Peak index in a mountain array
Java
0 vote187 views1 answer
Android list tostring
Java