Intersection of Multiple Arrays LeetCode solution in JavaScript

1
var intersection = function (nums) {
2
  let set = addToSet(nums[0]);
3
  for (let i = 1; i < nums.length; i++) {
4
    let tempSet = addToSet(nums[i]);
5
    for (let key of set) {
6
      if (!tempSet.has(key)) set.delete(key);
7
    }
8
  }
9
  return [...set].sort((a, b) => a - b);
10
};
11

12
function addToSet(arr) {
13
  let set = new Set(arr);
14
  return set;
15
}