349. Intersection of Two Arrays

?

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26

/**<br> * 349. Intersection of Two Arrays<br> * https://leetcode.com/problems/intersection-of-two-arrays/description/<br><br>Example 1:<br><br>Input: nums1 = [1,2,2,1], nums2 = [2,2]<br>Output: [2]<br><br>Example 2:<br><br>Input: nums1 = [4,9,5], nums2 = [9,4,9,8,4]<br>Output: [9,4]<br><br>Note:<br><br>Each element in the result must be unique.<br>The result can be in any order.Kotlin version<br> * */fun intersection(num1: IntArray, num2: IntArray): IntArray {         num1.sort();         num2.sort();         var index1 = 0;         var index2 = 0;         var map = HashMap<Int, Int>();         while (index1 < num1.size && index2 < num2.size) {             if (num1[index1] < num2[index2])                 index1++;             else if (num1[index1] > num2[index2])                 index2++;             else {                 if (map.get(num2[index2]) == null)                     map.put(num2[index2], num2[index2]);                 index1++;                 index2++;             }         }         var totalIndex = 0;         var result = IntArray(map.size);         map.forEach { (key, value) ->             result.set(totalIndex, key);             totalIndex++;         };         return result;     }