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 | 204 Views, 20143 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 | 204 Views, 20143 Search Bots | 80 Words Subscribe to Feed Burner

Related Articles

  1. Daily Interview Question: Find Cycles in a Graph
  2. New Vulnerabilities (CVE-2016-4581) have been detected in CentOS/RHEL/CloudLinux 7
  3. Daily Interview Question: Create a Simple Calculator
  4. Windows Scripting
  5. Daily Interview Problem: Largest Product of 3 Elements I
  6. [Daily Problem] Course Prerequisites
  7. Algorithm Interview: Maximum Path Sum in Binary Tree
  8. Spreadsheet Column Title
  9. Number of Ways to Climb Stairs
  10. Autorun.inf Virus Protection

Comments (0)

    Be the first one to comment this page !


Page Edited: May 11 2024 14:36:49 | RSS Subscription
How to Cook a Perfect Steak? | <meta name="robots" content="noindex, follow" />