LeetCode 349 Intersection of Two Arrays
来源:互联网 发布:神机妙算软件安装流程 编辑:程序博客网 时间:2024/06/05 09:52
题目:
Given two arrays, write a function to compute their intersection.
Example:
Given nums1 = [1, 2, 2, 1]
, nums2 = [2, 2]
, return [2]
.
Note:
- Each element in the result must be unique.
- The result can be in any order.
题目链接
给两个数组,要求找出两个数组的子集,且子集中的元素不重复。。。
思路是利用python的方便性,直接查询,边枚举边查询,若已添加到答案列表中便不再添加,毫无优化可言,,,惭愧,,,可能在枚举之前比较一下哪一个列表更短,就枚举哪一个列表可能时间会更短一些吧(抱头。。。)。
代码如下:
class Solution(object): def intersection(self, nums1, nums2): ans = [] for i in nums1: if i in nums2 and i not in ans: ans.append(i) return ans
阅读全文
1 0
- Leetcode-349 Intersection of Two Arrays
- leetcode 349 Intersection of Two Arrays C++
- LeetCode 349 Intersection of Two Arrays
- LeetCode-349&350.Intersection of Two Arrays
- LeetCode-349 Intersection of Two Arrays
- leetcode-Intersection of Two Arrays-349
- LeetCode 349 Intersection of Two Arrays
- LeetCode#349 Intersection of Two Arrays
- LeetCode(349)Intersection of Two Arrays
- [LeetCode]349 Intersection of Two Arrays
- [LeetCode-349] Intersection of Two Arrays(java)
- Leetcode 349 Intersection of Two Arrays
- LeetCode No.349 Intersection of Two Arrays
- leetcode-349-Intersection of Two Arrays
- [Leetcode 349]Intersection of Two Arrays
- leetcode 349 Intersection of Two Arrays
- Leetcode #349 Intersection of Two Arrays
- LeetCode 349 Intersection of Two Arrays
- 分享一份自己写的关于ssh框架自动生成Bean的源代码和思路
- springmvc的执行流程详解
- PHP连接MongoDB操作
- java实训第二天7/27
- 关于基于git分支开发流程的一点看法
- LeetCode 349 Intersection of Two Arrays
- c#关闭窗体时发生的事件,关闭窗体怎样出现确认取消弹框
- CSU-ACM2017暑期训练3 J
- 二叉树已知先序中序求后序,已知后序中序求先序
- 基于UDP的网络群聊系统
- 深入浅出WPF之Binding的使用(二)
- 0727-java入门基本
- python解析json
- hpuoj【1343】超水计算zz题【水题】