Skip to content

Search in Rotated Sorted Array#26

Open
prathyu116 wants to merge 21 commits intoWeCode-Community-Dev:mainfrom
prathyu116:prathyu
Open

Search in Rotated Sorted Array#26
prathyu116 wants to merge 21 commits intoWeCode-Community-Dev:mainfrom
prathyu116:prathyu

Conversation

@prathyu116
Copy link

No description provided.

prathyu116 added 21 commits March 18, 2025 13:17
    const arr = []
    const prefixArr = []
    const suffixArr = []
    for (let i = 0; i < nums.length; i++) {
        if (i === 0) {
            prefixArr[i] = 1

        } else {
            prefixArr[i] = prefixArr[i - 1] * nums[i - 1]
        }

    }
    for (var i = nums.length - 1; i >= 0; i--) {
        if (i === nums.length - 1) {
            suffixArr[i] = 1
        } else {
            suffixArr[i] = suffixArr[i + 1] * nums[i + 1]
        }
    }
    for (let i = 0; i < nums.length; i++) {
        arr[i] = prefixArr[i] * suffixArr[i]

    };
    return arr
}

    console.log(productExceptSelf([1, 2, 3, 4])); // [24, 12, 8, 6]

//

/*
rightProduct__index[i]___leftProduct
then rightProduct*leftProduct

https://youtu.be/TW2m8m_FNJE

*/
   var s = 0, e = nums.length - 1;
    var res = nums[0];

    while (s <= e) {
        if(nums[s] < nums[e]) {
            res = nums[s];
            break
        }
        var mid = Math.floor((s + e) / 2);
        res = Math.min(res, nums[mid]);
        if (nums[s] <= nums[mid]) { //left sort
            s = mid + 1; //got to right
        } else {
            e = mid;
        }
    }
    return res;

};
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

1 participant