/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 vote138 views1 answer
Mobile number validation in android
Java
4 votes144 views2 answers
Java run cmd
Java
0 vote155 views4 answers
Duckduckgo
Java
1 vote157 views1 answer
Spring mvc project example
Java
12 votes146 views1 answer
Android manifest cleartext traffic permitted
Java
2 votes174 views3 answers
List in java
Java
58 votes145 views6 answers
Remove last character from string java
Java
0 vote210 views1 answer
Aggregationoperation multi match
Java
0 vote137 views1 answer
Check self permission android write_external_storage
Java
1 vote146 views1 answer
Java convert a set to array
Java