javascript array to duplicate the method summary

  • 2020-05-27 04:26:45
  • OfStack

There are four algorithms to achieve this:

1 species:

Array.prototype.unique1 = function () {
 var n = []; //1 Two new temporary arrays 
 for (var i = 0; i < this.length; i++) // Traverses the current array 
  // If the current array is the first i I've saved it into a temporary array, so I'm gonna skip, 
  // Otherwise put the current item push Into the temporary array 
  if (n.indexOf(this[i]) == -1) n.push(this[i]);
 return n;

The second:

Array.prototype.unique2 = function()
    var n = {},r=[]; //n for hash Table, r Is a temporary array 
    for(var i = 0; i < this.length; i++) // Traverses the current array 
        if (!n[this[i]]) // if hash There is no current item in the table 
            n[this[i]] = true; // deposit hash table 
            r.push(this[i]); // Take the current item of the current array push Into the temporary array 
    return r;
} // This method is recommended   But you can't think about it." 222 "And 222 The problem of 

The second improved version:

// class hash An improved version of the method 
Array.prototype.unique2 = function () {
  var n = {}, r = [];
  for (var i = 0; i < this.length; i++) {
    if (!n[typeof (this[i]) + this[i]]) {
      n[typeof (this[i]) + this[i]] = true;
  return r

var arr=["222",222,2,2,3];
var newarry=arr.unique2();


Array.prototype.unique3 = function()
    var n = [this[0]]; // The result array 
    for(var i = 1; i < this.length; i++) // From the first 2 The item begins to traverse 
        // If the current array is the first i The item is first in the current array 1 The next position is not i . 
        // So that means the first i The terms are repeating, ignore them. Otherwise, put it into the result array 
        if (this.indexOf(this[i]) == i) n.push(this[i]);
    return n;

Both the first and third methods use the indexOf method of arrays. The purpose of this method is to find the first occurrence of the stored parameter in the array. Obviously, the js engine implements this method by iterating through the groups until it finds the target. So this function is going to waste a lot of time. The second method USES the hash table. Put the existing ones into an object in the form of subscripts. Subscript references are much faster than searching an array with indexOf.

In order to judge the efficiency of these three methods, I made a test program, generated an array of 10,000 random Numbers, and then used several methods to test the execution time. The results show that the second method is much faster than the other two methods. However, there should be more of the second method in terms of memory footprint, because there is an extra hash table. This is called space for time. You can also check out this test page.

The fourth method:

Array.prototype.unique4 = function()
    var re=[this[0]];
    for(var i = 1; i < this.length; i++)
        if( this[i] !== re[re.length-1])
    return re;

The idea is to sort the array and then compare two adjacent values. The JS native sort method is used for sorting, and the JS engine is supposed to use quicksort internally. The end result is that this method runs on average about three times as long as the second method, but much faster than the first and third methods.

That's all for this article, I hope you enjoy it.

Related articles: