To the Top
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 | 139 Views, 17311 Search Bots | 80 Words

Subscribe to Feed Burner | Browse | Archive
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:


class Solution:
def intersection(self, nums1, nums2):
# Fill this in.

print Solution().intersection([4, 9, 5], [9, 4, 9, 8, 4])
# [9, 4]
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 139 Views, 17311 Search Bots | 80 Words Subscribe to Feed Burner

Related Articles

  1. Daily Interview Puzzle: Intersection of Linked Lists
  2. Skip the readings, focus on problems. And use all the hints!
  3. Daily Interview Problem: Merge K Sorted Linked Lists
  4. Staying on a Chess Board
  5. Daily Interview Problem: Given two arrays, write a function to compute their intersection.
  6. Algorithm Interview: Shifted String
  7. Daily Interview Problem: Room scheduling
  8. Autorun.inf Virus Protection
  9. Two-Sum
  10. Daily Interview Problem: Minimum Removals for Valid Parenthesis

Comments (0)

    Be the first one to comment this page !


Page Edited: October 30 2020 14:21:09 | RSS Subscription
How to Cook a Perfect Steak? | <meta name="robots" content="index, follow">