Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Update Search in rotated array Question.java #212

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Update Search in rotated array Question.java #212

wants to merge 1 commit into from

Commits on Jan 23, 2021

  1. Update Question.java 

    Since nums=[3,1,1], x=1 is also a valid test case for this problem. But currently, the output of the code is -1 as  condition (a[left]==a[mid]) is false and there is not condition for (a[mid]==a[right]).
So, I have removed this condition and it works fine in Leetcode.
    @AshishJainMSRIT
    AshishJainMSRIT committed Jan 23, 2021
    Configuration menu
    Copy the full SHA
    1990277 View commit details
    Browse the repository at this point in the history