/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

3 votes217 views1 answer
Maf-9dfodfhgdok[sdfjyug
Java
1 vote222 views1 answer
Getting the last value of an integer in java
Java
0 vote181 views2 answers
Spigot item break
Java
0 vote244 views2 answers
Java or cpp
Java
1 vote192 views6 answers
Transformer un string en double java
Java
0 vote189 views1 answer
Spring boot put invalid cors request
Java
1 vote192 views1 answer
Update java windows
Java
5 votes184 views1 answer
Ubuntu change default java path
Java
0 vote198 views1 answer
Capture console output java
Java
0 vote210 views1 answer
Java pattern check
Java