g2201_2300.s2248_intersection_of_multiple_arrays.Solution.kt Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-kotlin Show documentation

Kotlin-based LeetCode algorithm problem solutions, regularly updated

There is a newer version: 1.32

package g2201_2300.s2248_intersection_of_multiple_arrays

// #Easy #Array #Hash_Table #Counting #2023_06_27_Time_197_ms_(100.00%)_Space_36.7_MB_(100.00%)

class Solution {
    fun intersection(nums: Array): List {
        val ans: MutableList = ArrayList()
        val count = IntArray(1001)
        for (arr in nums) {
            for (i in arr) {
                ++count[i]
            }
        }
        for (i in count.indices) {
            if (count[i] == nums.size) {
                ans.add(i)
            }
        }
        return ans
    }
}