forEach+includes(循环+ 判断是否存在数组) let arr = [1, 2, 1, 3, 2, 4, 3, 5, 4] let newArr = [] arr.forEach(v=>{ if(!newArr.includes(v)){ newArr.push(v) } }) 通过Set和拓展运算符 … let arr = [1, 2, 1, 3, 3, 45, 6, 7] let newArr = [...new Set(arr)] console.log(newArr) 数组先排序,在判断是否存储 function sortArr(arr) { let formArr = arr.sort() let newArr=[formArr[0]] for (let i = 1; i < formArr.length; i++) { if (formArr[i]!=formArr[i-1]) { newArr.push(formArr[i]) } } return newArr } console.log(sortArr([2,3,4,2,3,1,5,4,7,37,3,45]));