/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 vote129 views1 answer
Java komplettes array ausgeben
Java
2 votes134 views1 answer
Take a value from keyboard java
Java
1 vote148 views1 answer
MCQ java
Java
0 vote117 views1 answer
Ubuntu java compiler version
Java
0 vote135 views1 answer
Java exit from void method
Java
2 votes152 views1 answer
For loop in multidimensional array java
Java
5 votes153 views3 answers
Java remove space at the end of string
Java
0 vote251 views1 answer
Java code to compare csv file against a table
Java
-1 vote148 views1 answer
Taglib in jsp
Java
1 vote142 views1 answer
Concept of Association in java
Java