File: root - text - article - 2019 - 12 - given-two-arrays,-write-a-function-to-compute-their-intersection.txt.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 338 Views, 21964 Search Bots | 80 Words
| Browse | Archive
![Subscribe to Feed Burner Subscribe to Feed Burner](/images/form/rss.gif)
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 338 Views, 21964 Search Bots | 80 Words
![Subscribe to Feed Burner Subscribe to Feed Burner](/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:
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 338 Views, 21964 Search Bots | 80 Words 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]
![Subscribe to Feed Burner Subscribe to Feed Burner](/images/form/rss.gif)
Related Articles
- Daily Interview Question: Edit Distance
- Daily Interview Problem: Room scheduling
- Daily Interview Puzzle: Intersection of Linked Lists
- Daily Interview Problem: Min Stack
- Daily Interview Problem: Merge K Sorted Linked Lists
- Print a tree level-by-level, with line-breaks
- Batch Programming in XP
- Daily Interview Problem: Find the k-th Largest Element in a List
- Daily Interview Problem: Reverse Words in a String
- Maximum In A Stack
©2006~2024 SteakOverCooked - 0.00713 Seconds(s) - 2659.706 KB/s - 12 Online
Memory: 494.73 KB
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
How to Cook a Perfect Steak? | <meta name="robots" content="noindex, follow" />
![](/images/top.jpg)
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
Read & Write - Normal - Mini - Post - All Comments - Statistics
Be the first one to comment this page !