页面顶部 Top
文件:  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, | 英文 | 主页 | 类别: 计算机科学 | 139 次阅读, 17300 次搜索 | 80 个单词

定阅此目录的博客 | 浏览 | 博客存档
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]
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 139 次阅读, 17300 次搜索 | 80 个单词 定阅此目录的博客

猜您喜欢...

  1. Most Frequent Subtree Sum
  2. Reverse a Linked List
  3. Daily Interview Problem: Queue Using Two Stacks
  4. [Daily Problem] Course Prerequisites
  5. Daily Interview Puzzle: Minimum Size Subarray Sum
  6. Daily Interview Problem: Arithmetic Binary Tree
  7. Find Pythagorean Triplets
  8. Daily Interview Problem: Find the Number of Islands
  9. Daily Interview Problem: Distribute Bonuses
  10. Floor and Ceiling of a Binary Search Tree

评论 (0)

    当前页暂时没有评论。


最后更新: October 30 2020 14:21:12 | RSS Subscription
牛排怎么做才好吃? | <meta name="机器人" content="索引, 跟踪">