class Solution(object):

    def intersect(self, nums1, nums2):

        """

        :type nums1: List[int]

        :type nums2: List[int]

        :rtype: List[int]

        """

        # intersect=[]

        # for i in nums1:

        #     while i in nums2:

        #         intersect.append(i)

        # return intersect  #注释方法超出时间

        temp=list(set(nums1)&set(nums2))

        intersect=[]

        for i in temp:

            intersect+=[i]*min(nums1.count(i),nums2.count(i)) #list除了append，可以直接+ ；注意元素加[]

        return intersect