注册一亩三分地论坛,查看更多干货!
您需要 登录 才可以下载或查看附件。没有帐号?注册账号 
x
Given two arrays, write a function to compute their intersection.
Example:
Given nums1 = [1, 2, 2, 1], nums2 = [2, 2], return [2, 2].
Follow up:
What if elements of nums2 are stored on disk, and the memory is limited such that you cannot load all elements into the memory at once?
Anyone has idea about the follow up question? |