Array.prototype.method1 = function(){ 
      var arr[];  //定義一個(gè)臨時(shí)數(shù)組 
      for(var i = 0; i < this.length; i++){  //循環(huán)遍歷當(dāng)前數(shù)組 
        //判斷當(dāng)前數(shù)組下標(biāo)為i的元素是否已經(jīng)保存到臨時(shí)數(shù)組 
        //如果已保存，則跳過，否則將此元素保存到臨時(shí)數(shù)組中 
        if(arr1.indexOf(this[i]) == -1){ 
          arr.push(this[i]); 
        } 
      } 
      return arr; 
    }

Array.prototype.method2 = function(){ 
      var h{};  //定義一個(gè)hash表 
      var arr[]; //定義一個(gè)臨時(shí)數(shù)組 
       
      for(var i = 0; i < this.length; i++){  //循環(huán)遍歷當(dāng)前數(shù)組 
        //對元素進(jìn)行判斷，看是否已經(jīng)存在表中，如果存在則跳過，否則存入臨時(shí)數(shù)組 
        if(!h[this[i]]){ 
          //存入hash表 
          h[this[i]] = true; 
          //把當(dāng)前數(shù)組元素存入到臨時(shí)數(shù)組中 
          arr.push(this[i]); 
        } 
      } 
      return arr; 
    } 

Array.prototype.method3 = function(){ 
      //直接定義結(jié)果數(shù)組 
      var arr[this[0]]; 
      for(var i = 1; i < this.length; i++){  //從數(shù)組第二項(xiàng)開始循環(huán)遍歷此數(shù)組 
        //對元素進(jìn)行判斷： 
        //如果數(shù)組當(dāng)前元素在此數(shù)組中第一次出現(xiàn)的位置不是i 
        //那么我們可以判斷第i項(xiàng)元素是重復(fù)的，否則直接存入結(jié)果數(shù)組 
        if(this.indexOf(this[i]) == i){ 
          arr.push(this[i]); 
        } 
      } 
      return arr; 
     
    } 

Array.prototype.method4 = function(){ 
      //將數(shù)組進(jìn)行排序 
      this.sort(); 
      //定義結(jié)果數(shù)組 
      var arr[this[0]]; 
      for(var i = 1; i < this.length; i++){  //從數(shù)組第二項(xiàng)開始循環(huán)遍歷數(shù)組 
        //判斷相鄰兩個(gè)元素是否相等，如果相等說明數(shù)據(jù)重復(fù)，否則將元素寫入結(jié)果數(shù)組 
        if(this[i] !== arr[arr.length - 1]){ 
          arr.push(this[i]); 
        }       
      } 
      return arr; 
       
    } 

 var arr = [112,112,34,'你好',112,112,34,'你好','str','str1']; 
    alert(arr.method3()); 

function unique(arr) {
  var result = [], isRepeated;
  for (var i = 0, len = arr.length; i < len; i++) {
    isRepeated = false;
    for (var j = 0, len = result.length; j < len; j++) {
      if (arr[i] == result[j]) {  
        isRepeated = true;
        break;
      }
    }
    if (!isRepeated) {
      result.push(arr[i]);
    }
  }
  return result;
}

function unique(arr) {
  var result = [], hash = {};
  for (var i = 0, elem; (elem = arr[i]) != null; i++) {
    if (!hash[elem]) {
      result.push(elem);
      hash[elem] = true;
    }
  }
  return result;
}

<script>
var h_hewenqiArray = new Array();
h_hewenqiArray[0] = "jb51.net";
h_hewenqiArray[1] = "easysector";
h_hewenqiArray[2] = "jb51.net";
h_hewenqiArray[3] = "keleyi";
h_hewenqiArray[4] = "keleyi";
h_hewenqiArray[5] = "腳本之家";
h_hewenqiArray[6] = "jb51.net";
h_hewenqiArray[7] = "hoverclock";
h_hewenqiArray[8] = "yestop";
h_hewenqiArray[9] = 163;
h_hewenqiArray[10] = "腳本之家";
h_hewenqiArray[11] = 163;
h_hewenqiArray[12] = "hoverclock";
h_hewenqiArray[13] = "腳本之家";

var h_arrayLength = h_hewenqiArray.length;
document.write("原始數(shù)組元素個(gè)數(shù)："+h_arrayLength + "<br />");
for (var i = 0; i < h_arrayLength; i++)
{
document.write(h_hewenqiArray[i]+"<br />");
}


function hovercUnique(arr) {
var result = [], hash = {};
for (var i = 0, elem; (elem = arr[i]) != null; i++) {
if (!hash[elem]) {
result.push(elem);
hash[elem] = true;
}
}
return result;
//http://jb51.net.com
}

var h_hewenqiResult = hovercUnique(h_hewenqiArray);

var h_resultLength = h_hewenqiResult.length;
document.write("<br />去重復(fù)后數(shù)組元素個(gè)數(shù)：" + h_resultLength + "<br />");
for (var i = 0; i < h_resultLength; i++) {
document.write(h_hewenqiResult[i] + "<br />");
} 
</script>