functionunique1(arr){return[...newSet(arr)]}functionunique2(arr){var obj ={};return arr.filter(ele=>{if(!obj[ele]){
obj[ele]=true;returntrue;}})}functionunique3(arr){var result =[];
arr.forEach(ele=>{if(result.indexOf(ele)==-1){
result.push(ele)}})return result;}
2.字符串去重
String.prototype.unique=function(){var obj ={},
str ='',
len =this.length;for(var i =0; i < len; i++){if(!obj[this[i]]){
str +=this[i];
obj[this[i]]=true;}}return str;}
###### //去除连续的字符串 functionuniq(str){return str.replace(/(\w)\1+/g,'$1')}
3.找出字符串中第一次只出现一次的字母
String.prototype.firstAppear=function(){var obj ={},
len =this.length;for(var i =0; i < len; i++){if(obj[this[i]]){
obj[this[i]]++;}else{
obj[this[i]]=1;}}for(var prop in obj){if(obj[prop]==1){return prop;}}}
4.返回当前的时间(年月日时分秒)
functiongetDateTime(){var date =newDate(),
year = date.getFullYear(),
month = date.getMonth()+1,
day = date.getDate(),
hour = date.getHours()+1,
minute = date.getMinutes(),
second = date.getSeconds();
month =checkTime(month);
day =checkTime(day);
hour =checkTime(hour);
minute =checkTime(minute);
second =checkTime(second);functioncheckTime(i){if(i <10){
i ="0"+ i;}return i;}return""+ year +"年"+ month +"月"+ day +"日"+ hour +"时"+ minute +"分"+ second +"秒"}
5.检验字符串是否是回文
functionisPalina(str){if(Object.prototype.toString.call(str)!=='[object String]'){returnfalse;}var len = str.length;for(var i =0; i < len /2; i++){if(str[i]!= str[len -1- i]){returnfalse;}}returntrue;}
6.数组排序
```javascript
// 快排 [left] + min + [right]functionquickArr(arr){if(arr.length <=1){return arr;}var left =[],
right =[];var pIndex = Math.floor(arr.length /2);var p = arr.splice(pIndex,1)[0];for(var i =0; i < arr.length; i++){if(arr[i]<= p){
left.push(arr[i]);}else{
right.push(arr[i]);}}// 递归returnquickArr(left).concat([p],quickArr(right));}// 冒泡functionbubbleSort(arr){for(var i =0; i < arr.length -1; i++){for(var j = i +1; j < arr.length; j++){if(arr[i]> arr[j]){var temp = arr[i];
arr[i]= arr[j];
arr[j]= temp;}}}return arr;}functionbubbleSort(arr){var len = arr.length;for(var i =0; i < len -1; i++){for(var j =0; j < len -1- i; j++){if(arr[j]> arr[j +1]){var temp = arr[j];
arr[j]= arr[j +1];
arr[j +1]= temp;}}}return arr;}