python Simple Codes Use set()

  • 0
    class Solution(object):
        def intersection(self, nums1, nums2):
            :type nums1: List[int]
            :type nums2: List[int]
            :rtype: List[int]
            list = []
            if len(nums1) == 0 or len(nums2) == 0:
                return list
            s = set(nums1) & set(nums2)#get the hashSet
            #traverse the s
            for i in s:
                flag1 = 0 #the num exist in nums1
                flag2 = 0 #the num exist in nums2
                for j in nums1:
                    if i == j:
                        flag1 += 1
                for j in nums2:
                    if i == j:
                        flag2 += 1
                for k in range(min(flag1, flag2)):#put i for min(flag1, flag2) times to list
            return list

Log in to reply

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.