[LeetCode] 350. Intersection of Two Arrays II - 문제풀이
Description 주어진 두 배열의 교집합으로 이루어진 배열을 반환하는 문제입니다. Given two integer arrays nums1 and nums2, return an array of their intersection. Each element in the result must appear as many times as it shows in both arrays and you may return the result in any order. Example 1: Input: nums1 = [1,2,2,1], nums2 = [2,2] Output: [2,2] Example 2: Input: nums1 = [4,9,5], nums2 = [9,4,9,8,4] Output: [4,9] Explanatio..
