81-search-in-rotated-sorted-array-ii

DevGod

Vtuber

Caution

DevGod needs to write an editorial for this problem!

js

/**
 * @param {number[]} nums
 * @param {number} target
 * @return {boolean}
 */
var search = function(nums, target) {
    let L = 0;
    let R = nums.length-1;
    let M;

    let isSortedHalf = function(start,end){
        return nums[start] <= nums[end];
    }

    while(L <= R){
        M = Math.floor( (L+R)/2 );

        if(nums[M] === target){ return true; }

        if(nums[L] === nums[M] && nums[M] === nums[R]){
            L++;
            R--;
        }
        else if(isSortedHalf(L,M)){
            if( nums[L] <= target && target <= nums[M]){
                R = M - 1;
            }else{
                L = M + 1;
            }
        }else{
            if( nums[M] <= target && target <= nums[R]){
                L = M + 1;
            }else{
                R = M - 1;
            }
        }
    }

    return false;
};