/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 vote106 views1 answer
How to make a countdown timer in Android?
Java
0 vote91 views1 answer
Java resultset length
Java
1 vote97 views1 answer
How to sort a list of integers in java
Java
8 votes108 views3 answers
Len of number in java
Java
0 vote164 views1 answer
Spring boot intellij auto reload
Java Spring
2 votes104 views1 answer
Primefaces custom validator
Java
0 vote102 views1 answer
What is marshalling and unmarshalling in java
Java
5 votes137 views1 answer
Java for map
Java
0 vote111 views1 answer
Como limitar o random em java
Java
1 vote120 views1 answer
Shakescleare merchant of venice
Java