/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

2 votes194 views2 answers
Load file as string java
Java
0 vote209 views1 answer
What is the difference between Error and Exception? java
Java
0 vote199 views1 answer
Java break string at comma
Java
3 votes182 views1 answer
Java filewriter new line
Java
0 vote212 views1 answer
AccountDriver.java
Java
1 vote220 views1 answer
Install openjdk di linux
Java
5 votes188 views1 answer
Java stream find specific element
Java
-1 vote243 views1 answer
How to stop screen going off android studio
Java
0 vote221 views1 answer
How to assign null to a variable in Java
Java
0 vote200 views1 answer
Java convert ip to long
Java