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

Awesome Resource! Possible optimization to ThreeSum #1

Open

sigmonky opened this issue Oct 25, 2019 · 0 comments

sigmonky commented Oct 25, 2019 •

edited

Loading

NEVERMIND! fails on [-1,-1,-1]

Would filtering the sorted array like this

var lastVal: Int?
let sortedNums = nums.sorted().filter { (val) in
        if lastVal == nil {
            lastVal = val
            return true
        }
        if lastVal! == val {
            return false
        } else {
            lastVal = val
            return true
        }
    }

allow us to get rid of this?

if ((left - 1 > i) && (sortedNums[left] == sortedNums[left - 1]))

The text was updated successfully, but these errors were encountered:

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