{"id":9685,"date":"2022-04-27T08:47:02","date_gmt":"2022-04-27T15:47:02","guid":{"rendered":"https:\/\/zxi.mytechroad.com\/blog\/?p=9685"},"modified":"2022-04-27T08:47:19","modified_gmt":"2022-04-27T15:47:19","slug":"leetcode-2248-intersection-of-multiple-arrays","status":"publish","type":"post","link":"https:\/\/zxi.mytechroad.com\/blog\/hashtable\/leetcode-2248-intersection-of-multiple-arrays\/","title":{"rendered":"\u82b1\u82b1\u9171 LeetCode 2248. Intersection of Multiple Arrays"},"content":{"rendered":"\n

Given a 2D integer array nums<\/code> where nums[i]<\/code> is a non-empty array of distinct<\/strong> positive integers, return the list of integers that are present in each array<\/strong> of<\/em>nums<\/code> sorted in ascending order<\/strong><\/em>.<\/p>\n\n\n\n

Example 1:<\/strong><\/p>\n\n\n\n

Input:<\/strong> nums = [[3<\/strong>,1,2,4<\/strong>,5],[1,2,3<\/strong>,4<\/strong>],[3<\/strong>,4<\/strong>,5,6]]\nOutput:<\/strong> [3,4]\nExplanation:<\/strong> \nThe only integers present in each of nums[0] = [3<\/strong>,1,2,4<\/strong>,5], nums[1] = [1,2,3<\/strong>,4<\/strong>], and nums[2] = [3<\/strong>,4<\/strong>,5,6] are 3 and 4, so we return [3,4].<\/pre>\n\n\n\n
Example 2:<\/strong><\/p>\n\n\n\n
Input:<\/strong> nums = [[1,2,3],[4,5,6]]\nOutput:<\/strong> []\nExplanation:<\/strong> \nThere does not exist any integer present both in nums[0] and nums[1], so we return an empty list [].\n<\/pre>\n\n\n\n
Constraints:<\/strong><\/p>\n\n\n\n
  • 1 <= nums.length <= 1000<\/code><\/li>
  • 1 <= sum(nums[i].length) <= 1000<\/code><\/li>
  • 1 <= nums[i][j] <= 1000<\/code><\/li>
  • All the values of nums[i]<\/code> are unique<\/strong>.<\/li><\/ul>\n\n\n\n
    Solution: Hashtable<\/strong><\/h2>\n\n\n\n
    Time complexity: O(n)
    Space complexity: O(n)<\/p>\n\n\n\n
    \n
    C++<\/h2>\n
    \n\n
    \n\/\/ Author: Huahua\nclass Solution {\npublic:\n  vector intersection(vector>& nums) {\n    vector m(1001);\n    for (const auto& arr : nums)\n      for (const int x : arr)\n        ++m[x];\n    vector ans;\n    for (int i = 0; i < m.size(); ++i)\n      if (m[i] == nums.size())\n        ans.push_back(i);\n    return ans;\n  }\n};\n<\/pre>\n<\/div><\/div>\n","protected":false},"excerpt":{"rendered":"
    Given a 2D integer array nums where nums[i] is a non-empty array of distinct positive integers, return the list of integers that are present in each array ofnums sorted in ascending order. Example 1: Input: nums…<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[70],"tags":[20,222,82],"class_list":["post-9685","post","type-post","status-publish","format-standard","hentry","category-hashtable","tag-array","tag-easy","tag-hashtable","entry","simple"],"_links":{"self":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/9685","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/comments?post=9685"}],"version-history":[{"count":2,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/9685\/revisions"}],"predecessor-version":[{"id":9687,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/9685\/revisions\/9687"}],"wp:attachment":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/media?parent=9685"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/categories?post=9685"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/tags?post=9685"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}