leetcode350
来源:互联网 发布:java compareto() 编辑:程序博客网 时间:2024/06/03 14:15
350、easy 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.
Follow up:
What if the given array is already sorted? How would you optimize your algorithm?
What if nums1’s size is small compared to num2’s size? Which algorithm is better?
What if elements of nums2 are stored on disk, and the memory is limited such that you cannot load all elements into the memory at once?
我自己是这样做的,这样做并没有考虑follow up:class Solution(object): def intersect(self, nums1, nums2): """ :type nums1: List[int] :type nums2: List[int] :rtype: List[int] """ l=[] for num in nums1: if num in nums2: l.append(num) nums2.pop(nums2.index(num)) return l
0 0
- leetcode350
- 算法系列(5) leetcode350
- Leetcode350. Intersection of Two Arrays II
- Leetcode350. Intersection of Two Arrays II
- LeetCode350. Intersection of Two Arrays II
- LeetCOde350详细分析并附求解代码
- leetcode350~Intersection of Two Arrays II
- leetcode350. Intersection of Two Arrays II
- Leetcode350 - Intersection of Two Arrays II(two pointers)
- Leetcode350. Intersection of Two Arrays II很简单的做法
- Leetcode350 Intersection of Two Arrays II &Leetcode Intersection of Two Arrays
- CoreDate使用简介。
- android中Okhttp框架进行网络请求的工具类()
- LinkButoon、ImageButton 几种绑定和传参方式
- Java基本数据类型总结
- supervisor设置环境变量
- leetcode350
- 10个实用的但偏执的Java编程技术
- 1、线性表
- 【Mybatis】数据插入数据库时,获取自增主键
- Hibernate的复杂用法HibernateCallback
- 蓝牙 宽带通话 (wide band speech)WBS 剖析(一) -- profile层
- 集合
- [通知]实验检查
- mysql复制表结构创建新表