How to use Map data structure to remove duplicates in node

This article mainly introduces node how to use Map data structure to remove weight, the article is very detailed, has a certain reference value, interested friends must read it!

Using Map data structure to remove weight

Create an empty Map data structure, iterate through the array that needs to be deduplicated, and store each element of the array in Map as key. Since the same key value will not appear in Map, the final result is the de-duplicated result.

Function a (arr) {let map = new Map (); let array = new Array (); / / the array is used to return the result for (let I = 0; I < arr.length If +) {if (map.has (arr [I])) {/ / if the key value map.set (arr [I], true);} else {map.set (arr [I], false) / / if the key value array.push (arr [I]);}} return array;} var arr = [1, 1, 2, 2, 3, 3, 4, 4, 5, 5] Console.log (a (arr)) / / the above is all the contents of the article "how to use Map data structure to duplicate node". Thank you for reading! Hope to share the content to help you, more related knowledge, welcome to follow the industry information channel!