文件: root - text - article - 2019 - 12 - given-two-arrays,-write-a-function-to-compute-their-intersection.txt.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 337 次阅读, 21946 次搜索 | 80 个单词
| 浏览 | 博客存档
![定阅此目录的博客 定阅此目录的博客](/images/form/rss.gif)
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 337 次阅读, 21946 次搜索 | 80 个单词
![定阅此目录的博客 定阅此目录的博客](/images/form/rss.gif)
Hi, here's your problem today. This problem was recently asked by Amazon:
Given two arrays, write a function to compute their intersection - the intersection means the numbers that are in both arrays.
Example 1:
Input: nums1 = [1,2,2,1], nums2 = [2,2]
Output: [2]
Example 2:
Input: nums1 = [4,9,5], nums2 = [9,4,9,8,4]
Output: [9,4]
Note:
Each element in the result must be unique.
The result can be in any order.
Here's a starting point:
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 337 次阅读, 21946 次搜索 | 80 个单词 Given two arrays, write a function to compute their intersection - the intersection means the numbers that are in both arrays.
Example 1:
Input: nums1 = [1,2,2,1], nums2 = [2,2]
Output: [2]
Example 2:
Input: nums1 = [4,9,5], nums2 = [9,4,9,8,4]
Output: [9,4]
Note:
Each element in the result must be unique.
The result can be in any order.
Here's a starting point:
class Solution:
def intersection(self, nums1, nums2):
# Fill this in.
print Solution().intersection([4, 9, 5], [9, 4, 9, 8, 4])
# [9, 4]
![定阅此目录的博客 定阅此目录的博客](/images/form/rss.gif)
猜您喜欢...
- Algorithm Interview Question: Find the Single Element in an Array of Duplicates
- Daily Interview Problem: Maximum Profit From Stocks
- Palindrome Integers
- Daily Interview Problem:Create a balanced binary search tree
- Algorithm Interview: Convert Roman Numerals to Decimal
- CPU Utilization
- Daily Interview Problem: Tree Serialization
- Daily Interview Problem: Min Stack
- Daily Interview Puzzle: Minimum Size Subarray Sum
- Linode Support Ticket 10029540 - Other - Important Notice Regarding Ubuntu 17.10 Image
©2006~2024 牛排过熟 - 0.00725 秒 - 2744.259 KB/s - 9 在线
内存: 494.37 KB
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - 服务器 PHP 版本号: 7.4.33
牛排怎么做才好吃? | <meta name="机器人" content="不索引, 跟踪" />
![](/images/top.jpg)
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - 服务器 PHP 版本号: 7.4.33
读写完全 - 一般 - 最小 - 表格 - 所有评论 - 统计
当前页暂时没有评论。