计算两个数组的交
注意事项
每个元素出现次数得和在数组里一样
答案可以以任意顺序给出
样例
class Solution:
# @param {int[]} nums1 an integer array
# @param {int[]} nums2 an integer array
# @return {int[]} an integer array
def intersection(self, nums1, nums2):
# Write your code here
result = []
nums1.sort()
nums2.sort()
i = 0
j = 0
while (i < len(nums1) and j < len(nums2)):
if nums1[i] <nums2[j]:
i = i + 1
elif nums1[i] > nums2[j]:
j = j + 1
else:
result.append(nums1[i])
i = i + 1
j = j + 1
nums1 = [1, 2, 2, 1]
, nums2 = [2, 2]
, 返回 [2, 2]
.
---------------------------------------------------------------------------------------------------------
class Solution:
# @param {int[]} nums1 an integer array
# @param {int[]} nums2 an integer array
# @return {int[]} an integer array
def intersection(self, nums1, nums2):
# Write your code here
result = []
nums1.sort()
nums2.sort()
i = 0
j = 0
while (i < len(nums1) and j < len(nums2)):
if nums1[i] <nums2[j]:
i = i + 1
elif nums1[i] > nums2[j]:
j = j + 1
else:
result.append(nums1[i])
i = i + 1
j = j + 1
return result