同樓上，用對(duì)象映射比去數(shù)組里查下標(biāo)快多了，ES6的話直接用Set

var arr = ["蘋(píng)果", "蘋(píng)果", "西瓜", "蘋(píng)果", "西瓜", "香蕉", "香蕉"];
var resolveArr = function () {
  var obj = {};
  arr.forEach(function (v) {
    if (!obj[v]) {
      obj[v] = 1;     
    }
  });
  return Object.keys(obj);
};
console.log(resolveArr(arr));
//是不是很弱智，這么長(zhǎng)，hhh

var obj = {};
var arr = ["蘋(píng)果", "蘋(píng)果", "蘋(píng)果", "西瓜", "蘋(píng)果", "西瓜", "香蕉", "香蕉"];
var newArr = [];
var l = arr.length;
for (var i = 0; i < l; i++) {
  var item = arr[i];
  if (!obj[item]) {
    newArr.push(item);
    obj[item] = 1;
  }
}
console.log(newArr);

就是一個(gè)簡(jiǎn)單的去重

arr.reduce((p,n)=>{
    if(p.indexOf(n) === -1){
        p.push(n)
    }
    return p;
},[])

新建一個(gè)數(shù)組，對(duì)獲取的數(shù)據(jù)進(jìn)行遍歷，沒(méi)有的push進(jìn)去，有的排除，然后再輸出一下數(shù)據(jù)的長(zhǎng)度，就可以了

用loadash

_.uniq(你的數(shù)組)

這是個(gè)數(shù)組去重的問(wèn)題。
var arrLen = [...new Set(arr)].length;

const fruit = {}
const arr = ["蘋(píng)果","蘋(píng)果","西瓜","蘋(píng)果","西瓜","香蕉","香蕉"]
arr.forEach(item => fruit[item] ? fruit[item]++ : fruit[item] = 1)
console.log(Object.keys(fruit).length)

= = 對(duì)不起 我傻逼了 謝謝樓上提醒

console.log(new Set(["蘋(píng)果","蘋(píng)果","西瓜","蘋(píng)果","西瓜","香蕉","香蕉"]).size)

 var a = ["蘋(píng)果", "蘋(píng)果", "西瓜", "蘋(píng)果", "西瓜", "香蕉", "香蕉"],
n = a.filter(function(e, i, a) {
  return a.indexOf(e) === i;
});
console.log(n);

      var arr=["蘋(píng)果","蘋(píng)果","西瓜","蘋(píng)果","西瓜","香蕉","香蕉"];
      var fruits ={}
      arr.forEach((value)=>{
        fruits[value] = 1
      })

      var arr1 = []
      for(var fruit in fruits){
        arr1.push(fruit)
      }
      console.log(arr1);

//支持es6
let arr=["蘋(píng)果","蘋(píng)果","西瓜","蘋(píng)果","西瓜","香蕉","香蕉"];
let arrNew = Array.from(new Set(arr))
console.log(arrNew) 
看我文章有封裝 可調(diào)用

“ https://segmentfault.com/a/11...

//不支持es6  簡(jiǎn)單去重
百度一堆 就不寫(xiě)了

function find_duplicate_in_array(arra1) {
  var i,
  len=arra1.length,
  result = [],
  obj = {}; 
  for (i=0; i<len; i++)
  {
  obj[arra1[i]]=0;
  }
  for (i in obj) {
  result.push(i);
  }
  return result;
  }
var arr = [1, 2, -2, 4, 5, 4, 7, 8, 7, 7, 71, 3, 6];
console.log(find_duplicate_in_array(arr));

效果：
["1","2","3","4","5","6","7","8","71","-2"]

參考:JavaScript: Find duplicate values in a array