請(qǐng)看下面數(shù)組，其中的元素有多次重復(fù)，請(qǐng)寫一個(gè)函數(shù)來(lái)實(shí)現(xiàn)去除數(shù)組中重復(fù)的元素。

<script>
    let arr = [1, 1, 2, '2', 3, 4, 5, 6, 6, 7, 8, 9, 0, "a", "a", "b"];


    Array.prototype.unique = function () {
        let newArr = [],
            len = this.length,
            flag = true

        for (let i = len - 1; i >= 0; i--) {
            for (let j = 0; j < newArr.length; j++) {
                if (this[i] === newArr[j]) {
                    flag = false
                    break
                } else {
                    flag = true
                }
            }

            if (flag) {
                newArr.push(this[i])
            }
        }
        return newArr.reverse()
    }

使用with改進(jìn)

    Array.prototype.unique1 = function () {
        let newArr = [],
            flag = true,
            i = this.length,
            j = 0

        while (--i >= 0) {
            j = newArr.length
            while (--j >= 0) {
                flag = this[i] !== newArr[j]
                if (!flag) {
                    break
                }
            }
            flag && newArr.push(this[i])
        }
        return newArr.reverse()
    }

對(duì)象去除法

    Array.prototype.unique2 = function () {
        let newArr = [],
            obj = {},
            len = this.length

        for (let i = len - 1; i > 0; i--) {
            obj[this[i]] = ""
        }
        for (let key in obj) {
            newArr.push(key)
        }
        return newArr
    }

    //優(yōu)化對(duì)象去除法
    Array.prototype.unique3 = function () { //這種情況下無(wú)法判斷數(shù)組中元素的類型，如果不能去除不同類型的重復(fù)則需要改進(jìn)
        let newArr = [],
            obj = {},
            len = this.length

        for (let i = len - 1; i > 0; i--) {
            if (obj[this[i]] == undefined) {
                obj[this[i]] = ""
                newArr.push(this[i])
            }
        }
        return newArr.reverse()
    }

    //改進(jìn)可判數(shù)據(jù)類型
    Array.prototype.unique4 = function () { //這種情況下無(wú)法判斷數(shù)組中元素的類型，如果不能去除不同類型的重復(fù)則需要改進(jìn)
        let newArr = [],
            obj = {},
            len = this.length

        for (let i = len - 1; i > 0; i--) {
            if (obj[this[i]] == undefined || obj[this[i]] !== this[i]) {
                obj[this[i]] = this[i]
                newArr.push(this[i])
            }
        }
        return newArr.reverse()
    }

    Array.prototype.unique5 = function () {
        let newArr = [],
            obj = {},
            i = this.length

        while (--i) {
            (obj[this[i] == undefined] || obj[this[i]] !== this[i]) && (obj[this[i]] = this[i], newArr.push(this[i]))
        }

        return newArr.reverse()
    }

通過(guò)正則實(shí)現(xiàn)去重

    Array.prototype.unique6 = function () {
        let newArr = [],
            arr1 = []

        arr1 = arr.join(',').match(/([^\,]+)(?!.*\1)/ig)
        arr1.forEach(item => {
            /[a-zA-z]/.test(item) ? newArr.push(item) : newArr.push(parseInt(item))
        })

        return newArr
    }

    console.log(arr.unique6())
</script>

通過(guò)數(shù)組indexOF方法實(shí)現(xiàn)去重

    Array.prototype.unique7 = function(){
        var arr = []
        for(var i=0; i<this.length; i++){
            if(arr.indexOf(this[i]) === -1){
                arr.push(this[i])
            }
        }
        return arr
    }
    
    var a = [1,2,3,3,2,1,42,3]
    
    var c = a.unique2()