LeetCode in Kotlin
349. Intersection of Two Arrays
Easy
Given two integer arrays nums1 and nums2, return an array of their intersection. Each element in the result must be unique and you may return the result in any order.
Example 1:
Input: nums1 = [1,2,2,1], nums2 = [2,2]
Output: [2]
Example 2:
Input: nums1 = [4,9,5], nums2 = [9,4,9,8,4]
Output: [9,4]
Explanation: [4,9] is also accepted.
Constraints:
1 <= nums1.length, nums2.length <= 10000 <= nums1[i], nums2[i] <= 1000
Solution
class Solution {
fun intersection(nums1: IntArray, nums2: IntArray): IntArray {
val occ = BooleanArray(1001)
for (k in nums1) {
occ[k] = true
}
val res: MutableList<Int> = ArrayList()
for (j in nums2) {
if (occ[j]) {
occ[j] = false
res.add(j)
}
}
val result = IntArray(res.size)
for (i in res.indices) {
result[i] = res[i]
}
return result
}
}