leetcode—350. Intersection of Two Arrays II 求两个list的交集

题目：

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

Example:
Given nums1 = [1, 2, 2, 1], nums2 = [2, 2], return [2, 2].

Note:

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

题意：

求两个list的交集，交集中元素出现次数与它在两个list中出现次数一样

代码：

class Solution(object):
    def intersect(self, nums1, nums2):
        """
        :type nums1: List[int]
        :type nums2: List[int]
        :rtype: List[int]
        """
        
        lis = []
        for x in nums1 :
            if x in nums2 :
                lis.append(x)
                nums2.remove(x)
        return lis