[LeetCode&Python] Problem 350. Intersection of Two Arrays II

Given two arrays, write a function to compute their intersection.

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]

Note:

• Each element in the result should appear as many times as it shows in both arrays.
• The result can be in any order.

class Solution(object):
    def intersect(self, nums1, nums2):
        """
        :type nums1: List[int]
        :type nums2: List[int]
        :rtype: List[int]
        """
        n1=len(nums1)
        n2=len(nums2)

        if n2>n1:
            temp=nums1
            nums1=nums2
            nums2=temp
            te=n1
            n1=n2
            n2=te

        ans=[]

        for i in range(n2):
            if nums2[i] in nums1:
                ans.append(nums2[i])
                nums1.remove(nums2[i])
        return ans