/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

0 vote231 views1 answer
Iterate map in java 8 using stream
Java
1 vote195 views1 answer
Java trim string to length
Java
0 vote230 views1 answer
Java connect socket to POP3
Java
3 votes225 views1 answer
Regrex for letter in java
Java
0 vote225 views1 answer
2 multiples
Java
3 votes237 views3 answers
Rgb to hex java
Java
5 votes255 views1 answer
Change java version command line debian
Java
-1 vote238 views1 answer
Java array repeating
Java
0 vote238 views2 answers
Javaprov
Java
0 vote245 views1 answer
Comparer deux entiers java
Java