Search in Rotated Sorted Array II

最新推荐文章于 2024-09-18 20:33:32 发布

dutsoft

最新推荐文章于 2024-09-18 20:33:32 发布

阅读量415

点赞数

文章标签：算法查找

本文链接：https://blog.csdn.net/dutsoft/article/details/38582091

版权

LeetCode 专栏收录该内容

111 篇文章 0 订阅

订阅专栏

Follow up for "Search in Rotated Sorted Array":
What if duplicates are allowed?

Would this affect the run-time complexity? How and why?

Write a function to determine if a given target is in the array.

public class Solution {
    public boolean search(int[] A, int target) {
        if(A==null || A.length<=0) return false;
        int index1=0;
        int index2=A.length;
        int midIndex=index1;
        //if(A.length==1 && A[0]==target) return true;
        while(index1!=index2){
            midIndex=index1+(index2-index1)/2;
            if(A[midIndex]==target) return true;
            else if(A[index1]<A[midIndex]){
                if(A[index1]<=target && target<A[midIndex]){
                    index2=midIndex;
                }
                else{
                    index1=midIndex+1;
                }
            }
            else if(A[index1]>A[midIndex]){
                if(A[midIndex]<=target && target<=A[index2-1]){
                    index1=midIndex+1;
                }
                else{
                    index2=midIndex;
                }
            }
            else{
                //skip duplicate elements
                index1++;
            }
        }
        return false;
    }
}