Leetcode no.349 the intersection of two arrays (Python implementation)

Source

https://leetcode-cn.com/problems/intersection-of-two-arrays/

Title Description

Given two arrays, write a function to calculate the intersection of them.
Example:
Given num1= [1, 2, 2, 1], nums2 = [2, 2], return [2].
Tips:
Each element in the result must be unique.
We can not consider the order of the output results.

Code implementation

class Solution(object):    def intersection(self, nums1, nums2):        """        :type nums1: List[int]        :type nums2: List[int]        :rtype: List[int]        """        nums = set(nums1) & set(nums2)        if nums:            nums = list(nums)        else:            nums = []        return nums

Leetcode no.349 the intersection of two arrays (Python implementation)