JAVA_LeetCode 1122_Relative Sort Array

JAVA_LeetCode 1122_Relative Sort Array 풀이 class Solution { public int[] relativeSortArray(int[] arr1, int[] arr2) { Map<Integer,Integer> map = new HashMap<>(); int cnt = 0, cnt2 = 0; for(int num : arr2) map.put(num, 0); for(int i = 0; i < arr1.length; i++){ if(map.containsKey(arr1[i])){ map.put(arr1[i], map.get(arr1[i]) + 1); arr1[i] = -1; } } Arrays.sort(arr1); for(int num: arr2){ cnt2 = map.remove(num); while (cnt2 > 0){ arr1[cnt++] = num; cnt2--; } } return arr1; } } * 출처 https://leetcode.com...

원문링크 : JAVA_LeetCode 1122_Relative Sort Array