/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 votes170 views1 answer
Java get location of jar file
Java
0 vote171 views1 answer
Resultset previous
Java
0 vote131 views1 answer
Java variable declared
Java
0 vote206 views4 answers
For() in java
Java
2 votes315 views1 answer
Spring boot resource optional request param
Java Spring
0 vote202 views1 answer
Java tostring methode überschreiben
Java
0 vote172 views1 answer
Thymeleaf string not equal
Java
0 vote171 views1 answer
Teimpo en segundos java
Java
0 vote168 views1 answer
Java memory increase command
Java
0 vote198 views1 answer
Association in java
Java