Skip to content

Instantly share code, notes, and snippets.

@bendc

bendc/removeDuplicates.js

Last active February 5, 2021 16:57
Show Gist options

  • Select an option

    Learn more about clone URLs
  • Save bendc/da83fdac68a1095f3595 to your computer and use it in GitHub Desktop.

Select an option

Learn more about clone URLs
Save bendc/da83fdac68a1095f3595 to your computer and use it in GitHub Desktop.
Download ZIP

Revisions

  1. bendc revised this gist Dec 9, 2014. 1 changed file with 1 addition and 2 deletions.
    3 changes: 1 addition & 2 deletions removeDuplicates.js
    View file
    Original file line number Diff line number Diff line change
    @@ -14,8 +14,7 @@ function removeDuplicates(arr) {
    }

    if (duplicate) continue
    clean[cleanLen] = el
    cleanLen++
    clean[cleanLen++] = el
    }

    return clean
  2. bendc revised this gist Dec 9, 2014. 1 changed file with 1 addition and 1 deletion.
    2 changes: 1 addition & 1 deletion removeDuplicates.js
    View file
    Original file line number Diff line number Diff line change
    @@ -8,7 +8,7 @@ function removeDuplicates(arr) {
    var duplicate = false

    for (var j = 0; j < cleanLen; j++) {
    if (el != clean[j]) continue
    if (el !== clean[j]) continue
    duplicate = true
    break
    }
  3. bendc renamed this gist Dec 9, 2014. 1 changed file with 0 additions and 0 deletions.
    0 removeDuplicates → removeDuplicates.js
    View file
    File renamed without changes.
  4. bendc created this gist Dec 9, 2014.
    22 changes: 22 additions & 0 deletions removeDuplicates
    View file
    Original file line number Diff line number Diff line change
    @@ -0,0 +1,22 @@
    function removeDuplicates(arr) {
    var clean = []
    var cleanLen = 0
    var arrLen = arr.length

    for (var i = 0; i < arrLen; i++) {
    var el = arr[i]
    var duplicate = false

    for (var j = 0; j < cleanLen; j++) {
    if (el != clean[j]) continue
    duplicate = true
    break
    }

    if (duplicate) continue
    clean[cleanLen] = el
    cleanLen++
    }

    return clean
    }