{"id":8549,"date":"2021-08-09T19:26:48","date_gmt":"2021-08-10T02:26:48","guid":{"rendered":"https:\/\/zxi.mytechroad.com\/blog\/?p=8549"},"modified":"2021-08-09T19:26:58","modified_gmt":"2021-08-10T02:26:58","slug":"leetcode-1893-check-if-all-the-integers-in-a-range-are-covered","status":"publish","type":"post","link":"https:\/\/zxi.mytechroad.com\/blog\/hashtable\/leetcode-1893-check-if-all-the-integers-in-a-range-are-covered\/","title":{"rendered":"\u82b1\u82b1\u9171 LeetCode 1893. Check if All the Integers in a Range Are Covered"},"content":{"rendered":"\n

You are given a 2D integer array ranges<\/code> and two integers left<\/code> and right<\/code>. Each ranges[i] = [starti<\/sub>, endi<\/sub>]<\/code> represents an inclusive<\/strong> interval between starti<\/sub><\/code> and endi<\/sub><\/code>.<\/p>\n\n\n\n

Return true<\/code> if each integer in the inclusive range<\/em> [left, right]<\/code> is covered by at least one<\/strong> interval in<\/em> ranges<\/code>. Return false<\/code> otherwise<\/em>.<\/p>\n\n\n\n

An integer x<\/code> is covered by an interval ranges[i] = [starti<\/sub>, endi<\/sub>]<\/code> if starti<\/sub> <= x <= endi<\/sub><\/code>.<\/p>\n\n\n\n

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

Input:<\/strong> ranges = [[1,2],[3,4],[5,6]], left = 2, right = 5\nOutput:<\/strong> true\nExplanation:<\/strong> Every integer between 2 and 5 is covered:\n- 2 is covered by the first range.\n- 3 and 4 are covered by the second range.\n- 5 is covered by the third range.\n<\/pre>\n\n\n\n
Example 2:<\/strong><\/p>\n\n\n\n
Input:<\/strong> ranges = [[1,10],[10,20]], left = 21, right = 21\nOutput:<\/strong> false\nExplanation:<\/strong> 21 is not covered by any range.\n<\/pre>\n\n\n\n
Constraints:<\/strong><\/p>\n\n\n\n
  • 1 <= ranges.length <= 50<\/code><\/li>
  • 1 <= starti<\/sub> <= endi<\/sub> <= 50<\/code><\/li>
  • 1 <= left <= right <= 50<\/code><\/li><\/ul>\n\n\n\n
    Solution 1: Hashtable<\/strong><\/h2>\n\n\n\n
    Time complexity: O(n * (right – left))
    Space complexity: O(right – left)<\/p>\n\n\n\n
    \n
    C++<\/h2>\n
    \n\n
    \n\/\/ Author: Huahua\nclass Solution {\npublic:  \n  bool isCovered(vector>& ranges, int left, int right) {\n    unordered_set s;\n    for (const auto& range : ranges)\n      for (int i = max(left, range[0]); i <= min(right, range[1]); ++i)\n        s.insert(i);    \n    return s.size() == right - left + 1;\n  }\n};\n<\/pre>\n<\/div><\/div>\n","protected":false},"excerpt":{"rendered":"
    You are given a 2D integer array ranges and two integers left and right. Each ranges[i] = [starti, endi] represents an inclusive interval between starti and endi. Return true if each integer in the inclusive range [left, right] is covered by at…<\/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":[222,82,139],"class_list":["post-8549","post","type-post","status-publish","format-standard","hentry","category-hashtable","tag-easy","tag-hashtable","tag-range","entry","simple"],"_links":{"self":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/8549","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=8549"}],"version-history":[{"count":2,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/8549\/revisions"}],"predecessor-version":[{"id":8551,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/8549\/revisions\/8551"}],"wp:attachment":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/media?parent=8549"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/categories?post=8549"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/tags?post=8549"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}