/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 vote330 views1 answer
How to write 1,2,3,4.... in java
Java
2 votes413 views1 answer
Spring mvc get all request parameters
Java Spring
4 votes270 views2 answers
How to clear text field in java swing
Java
2 votes312 views1 answer
Android how to split string
Java
0 vote413 views2 answers
Spring code in java
Java Spring
1 vote322 views1 answer
Menghitung luas segitiga
Java
1 vote361 views1 answer
Java send an image over a socket
Java
0 vote311 views1 answer
Hide tablayout tab android
Java
0 vote340 views1 answer
Converting data in java
Java
0 vote306 views1 answer
Jlabel icon
Java