A. For use for nesting, and then to re-splice
let arr=[5,5,5,12,12,-3,33,33,35,8];
for( let i=0; i<arr.length;i++){
for(let k=i+1;k<arr.length;k++){
if(arr[i]===arr[k]){
arr.splice(i,1);
i--;
}
}}
console.log(arr)
Two. The Set method to weight
let arr = [1,2,2,3,4,3,1,6,7,3,5,7];
let s1 = new Set(arr);
let arr2 = [...s1];
console.log(arr2);
III. To re-use indexOf
ARR = the let [1,2,4,4,5,6,7,7,8,9];
the let S = []; // iterate
for (var i = 0; i <arr.length; i ++) {
iF (s.indexOf (ARR [I]) == -1) {// determines whether there is an array of s, s does not exist to push the array
s.push (ARR [I]);
}
}
Console. log (s);
IV. To re-use sort
let arr=[1, 1, 2, 3, 5, 3, 1, 5, 6, 7, 4];
function unique(arr) {
if (!Array.isArray(arr)) {
console.log('type error!')
return;
}
arr = arr.sort()
var arrry= [arr[0]];
for (var i = 1; i < arr.length; i++) {
if (arr[i] !== arr[i-1]) {
arrry.push(arr[i]);
}
}
return arrry;
}
console.log(unique(arr));
V. double for recycling, re-use push to achieve results
let arr=[1,2,4,4,5,6,7,7,8,9];
let newArr = []
for (let i = 0; i < arr.length; i++) {
for (let j = i + 1; j < arr.length; j++) {
if (arr[i] === arr[j]) {
i++;
}
}
newArr.push(arr[i])
}
console.log(newArr)