/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 votes267 views1 answer
Java get class by string name
Java
4 votes272 views2 answers
Spigot repeating task
Java
-1 vote269 views1 answer
Polimorfismo java ejemplo
Java
-1 vote244 views1 answer
Sorting algorithms in java
Java
3 votes258 views1 answer
How to learn java in one day
Java
1 vote249 views1 answer
Java jtextfield text bold
Java
0 vote259 views2 answers
Android studio clear child views
Java
2 votes258 views1 answer
Set password visible in android
Java
0 vote266 views1 answer
Duplicate class com.google.common.util.concurrent.ListenableFuture found in modules jetified-guava-24.1-jre (com.google.guava:guava:24.1-jre) and jetified-listenablefuture-1.0 (com.google.guava:listenablefuture:1.0)
Java
0 vote262 views1 answer
Java jframe image
Java