350. Intersection of Two Arrays II [easy] (Python)

题目链接

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

题目原文

Given two arrays, write a function to compute their intersection.

Example:
Given nums1 = [1, 2, 2, 1], nums2 = [2, 2], return [2, 2].

Note:
Each element in the result should appear as many times as it shows in both arrays.
The result can be in any order.

题目翻译

给定两个数组，写一个函数计算它们的交。
比如：给定 nums1 = [1, 2, 2, 1]， nums2 = [2, 2]，返回 [2, 2]。
注意：结果中每个元素出现的次数应该与它同时出现在两个数组中的次数相同；结果的顺序没有要求。

思路方法

思路一

暴力查找法，遍历第一个列表的每个元素，并在第二个列表中查找该元素是否出现，若出现且结果集中没有，则加入到结果集中。

代码

class Solution(object):
    def intersect(self, nums1, nums2):
        """
        :type nums1: List[int]
        :type nums2: List[int]
        :rtype: List[int]
        """
        res = []
        for k in nums1:
            index = -1