/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

7 votes92 views3 answers
Incremento java
Java
15 votes148 views2 answers
Ansi colors
Java
1 vote179 views1 answer
Bigdecimal to string
Java
0 vote159 views1 answer
How to get a set from a map in java
Java
0 vote151 views1 answer
Java stack with max size
Java
4 votes138 views2 answers
Binary search java
Java
0 vote162 views1 answer
Lcm
Java
1 vote158 views1 answer
Java kecodes
Java
1 vote141 views1 answer
Package within another java
Java
0 vote141 views1 answer
Linux mint switch language
Java