@@ -0,0 +1,762 @@
+class Solution(object):%0A    def intersect(self, nums1, nums2):%0A        %22%22%22%0A        :type nums1: List%5Bint%5D%0A        :type nums2: List%5Bint%5D%0A        :rtype: List%5Bint%5D%0A        %22%22%22%0A        numItersection = %5B%5D%0A        # print len(nums1)%0A        # print len(nums2)%0A        if len(nums1) %3C= len(nums2):%0A            for n in nums1:%0A                if n in nums2:%0A                    nums2.remove(n)%0A                    numItersection.append(n)%0A        else:%0A            for n in nums2:%0A                # print n%0A                if n in nums1:%0A                    nums1.remove(n)%0A                    numItersection.append(n)%0A        return numItersection%0A%0Aif __name__ == '__main__':%0A    nums1 = %5B1,2%5D%0A    nums2 = %5B2,1%5D%0A    s = Solution()%0A    print s.intersect(nums1,nums2)%0A

Intersection of two array