1122. Relative Sort Array

#1122. Relative Sort Array

Given two arrays arr1 and arr2, the elements of arr2 are distinct, and all elements in arr2 are also in arr1.
Sort the elements of arr1 such that the relative ordering of items in arr1 are the same as in arr2. Elements that don’t appear in arr2 should be placed at the end of arr1 in ascending order.

Example 1:
Input: arr1 = [2,3,1,3,2,4,6,7,9,2,19], arr2 = [2,1,4,3,9,6]
Output: [2,2,2,1,4,3,3,9,6,7,19]

这道题的意思是把arr1中的数字按照arr2中的数字顺序来排序。不在arr2中的数字就升序的放到后面。
首先创建一个arr1的map, 然后分别按照在arr2中和不在arr2中分成两个数组，然后拼接两个数组。

/**
 * @param {number[]} arr1
 * @param {number[]} arr2
 * @return {number[]}
 */
var relativeSortArray = function(arr1, arr2) {
    var map=new Map();
    for(let item of arr1) {
        if(!map.get(item)) {
            map.set(item,1);
        }
        else {
            map.set(item,parseInt(map.get(item))+1);
        }
    }
    var inarr2=[];
    var notinarr2=[];
    for(let item of arr2) {
        if(map.get(item)) {
            for(var i=0;i<map.get(item);i++) {
                inarr2.push(item);
            }
            map.delete(item);
        }    
    }
    console.log(inarr2)
    map.forEach((val,key) => {
        for(var j=0;j<val;j++) {
            notinarr2.push(key)
        }
    })
    notinarr2.sort(function(a, b){return a - b});
    console.log(notinarr2)
    return inarr2.concat(notinarr2);
};