Simple Scala Solution
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nobject Solution {\n    def findIntersectionValues(nums1: Array[Int], nums2: Array[Int]): Array[Int] = {\n        var result=new Array[Int](2)\n        result(0)=0\n        result(1)=0\n        for(x<-nums1){\n            if(nums2.contains(x)){\n                result(0)+=1\n            }\n        }\n        for(x<-nums2){\n            if(nums1.contains(x)){\n                result(1)+=1\n            }\n        }\n        return result\n    }\n}\n```
['Array', 'Scala']