yuanganping / leetcode Goto Github PK

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

        nums1.sort(reverse = False)
        nums2.sort(reverse = False)

        a = 0

        for i in range(0, len(nums1)):
            for n in range(a, len(nums2)):
                if nums2[n] == nums1[i]:
                    result.append(nums2[n])
                    a = n + 1
                    break
        return result