// post-sorting adjacent removal method arr=[1,2,5,1,3,7,9,5]; function Unique (arr) { arr.sort (); var _arr=[arr[0]]; // result Array for (var i=0;i<arr.length;i++) { if(arr[i]!=_arr[_arr.length-1]) { _arr.push (Arr[i]); } } return _arr; } Unique (arr);
//Traversal Array Method if(Array.prototype.indexof===-1) {Array.prototype.indexOf=function(Value,fromi) {Fromi===undefined&& (fromi=0); for(vari=fromi;i< This. length;i++){ if( This[i]=value) { return true; }Else{ return-1; }}}} arr=[1,2,5,1,3,7,9,5] functionUnique (arr) {var_arr=[];//new Temporary Array for(vari=0;i<arr.length;i++){ if(_arr.indexof (Arr[i]) ==-1) {//If Arr has been saved in _arr, then skip, //Otherwise push the current item into the temporary array (not in _arr ( -1))_arr.push (Arr[i]); } } return_arr; } console.log (String unique (arr ));
* Resolve IE8 compatibility issues first
Write a method that removes duplicate elements from the array