{"id":586,"date":"2017-10-14T21:58:15","date_gmt":"2017-10-15T04:58:15","guid":{"rendered":"http:\/\/zxi.mytechroad.com\/blog\/?p=586"},"modified":"2018-04-19T08:38:11","modified_gmt":"2018-04-19T15:38:11","slug":"leetcode-57-insert-interval","status":"publish","type":"post","link":"https:\/\/zxi.mytechroad.com\/blog\/geometry\/leetcode-57-insert-interval\/","title":{"rendered":"\u82b1\u82b1\u9171 LeetCode 57. Insert Interval"},"content":{"rendered":"<p><iframe loading=\"lazy\" title=\"\u82b1\u82b1\u9171 LeetCode 57. Insert Interval - \u5237\u9898\u627e\u5de5\u4f5c EP86\" width=\"500\" height=\"375\" src=\"https:\/\/www.youtube.com\/embed\/oWHWDI2eOHY?feature=oembed\" frameborder=\"0\" allow=\"accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share\" referrerpolicy=\"strict-origin-when-cross-origin\" allowfullscreen><\/iframe><\/p>\n<p><strong>Problem:<\/strong><\/p>\n<div class=\"question-description\">\n<p>Given a set of\u00a0<i>non-overlapping<\/i>\u00a0intervals, insert a new interval into the intervals (merge if necessary).<\/p>\n<p>You may assume that the intervals were initially sorted according to their start times.<\/p>\n<p><b>Example 1:<\/b><br \/>\nGiven intervals\u00a0<code>[1,3],[6,9]<\/code>, insert and merge\u00a0<code>[2,5]<\/code>\u00a0in as\u00a0<code>[1,5],[6,9]<\/code>.<\/p>\n<p><b>Example 2:<\/b><br \/>\nGiven\u00a0<code>[1,2],[3,5],[6,7],[8,10],[12,16]<\/code>, insert and merge\u00a0<code>[4,9]<\/code>\u00a0in as\u00a0<code>[1,2],[3,10],[12,16]<\/code>.<\/p>\n<p>This is because the new interval\u00a0<code>[4,9]<\/code>\u00a0overlaps with\u00a0<code>[3,5],[6,7],[8,10].<\/code><\/p>\n<p><script async src=\"\/\/pagead2.googlesyndication.com\/pagead\/js\/adsbygoogle.js\"><\/script><br \/>\n<ins class=\"adsbygoogle\" style=\"display: block; text-align: center;\" data-ad-layout=\"in-article\" data-ad-format=\"fluid\" data-ad-client=\"ca-pub-2404451723245401\" data-ad-slot=\"7983117522\"><\/ins><br \/>\n<script>\n     (adsbygoogle = window.adsbygoogle || []).push({});\n<\/script><\/p>\n<p><strong>Idea:<\/strong><\/p>\n<p>Find the position of the new interval, insert it into the list and call MergeIntervals in <a href=\"http:\/\/zxi.mytechroad.com\/blog\/geometry\/leetcode-56-merge-intervals\/\">LeetCode 56<\/a><\/p>\n<\/div>\n<p><strong>Solution:<\/strong><\/p>\n<p>C++<\/p>\n<pre class=\"lang:c++ decode:true\">\/\/ Author: Huahua\r\n\/\/ Runtime: 16 ms\r\nclass Solution {\r\npublic:\r\n    vector&lt;Interval&gt; insert(vector&lt;Interval&gt;&amp; intervals, Interval newInterval) {\r\n        auto it = intervals.begin();\r\n        while (it != intervals.end() &amp;&amp; newInterval.start &gt; it-&gt;start) ++it;\r\n        intervals.insert(it, newInterval);\r\n        \r\n        \/\/ Merge intervals without sorting\r\n        vector&lt;Interval&gt; ans;        \r\n        for (const auto&amp; interval : intervals) {\r\n            if (ans.empty() || interval.start &gt; ans.back().end) {\r\n                ans.push_back(interval);\r\n            } else {\r\n                ans.back().end = max(ans.back().end, interval.end);\r\n            }\r\n        }\r\n        \r\n        return ans;\r\n    }\r\n};<\/pre>\n<p>&nbsp;<\/p>\n<p>Python<\/p>\n<pre class=\"lang:python decode:true\">\"\"\"\r\nAuthor: Huahua\r\nRuntime: 78 ms\r\n\"\"\"\r\nclass Solution(object):\r\n    def insert(self, intervals, newInterval):\r\n        \r\n        index = len(intervals)\r\n        for i in range(len(intervals)):\r\n            if newInterval.start &lt; intervals[i].start:\r\n                index = i\r\n                break\r\n        \r\n        intervals.insert(index, newInterval)\r\n        \r\n        ans = []\r\n        for interval in intervals:\r\n            if not ans or interval.start &gt; ans[-1].end:\r\n                ans.append(interval)\r\n            else:\r\n                ans[-1].end = max(ans[-1].end, interval.end)\r\n        return ans<\/pre>\n<p>&nbsp;<\/p>\n<p>Solution 2:<\/p>\n<p>C++<\/p>\n<pre class=\"lang:c++ decode:true \">\/\/ Author: Huahua\r\n\/\/ Runtime: 13 ms\r\nclass Solution {\r\npublic:\r\n    vector&lt;Interval&gt; insert(vector&lt;Interval&gt;&amp; intervals, Interval newInterval) {\r\n        vector&lt;Interval&gt; l;\r\n        vector&lt;Interval&gt; r;\r\n        int start = newInterval.start;\r\n        int end = newInterval.end;\r\n        for (const Interval&amp; interval : intervals) {\r\n            if (interval.end &lt; start)\r\n                l.push_back(interval);\r\n            else if (interval.start &gt; end)\r\n                r.push_back(interval);\r\n            else {\r\n                start = min(start, interval.start);\r\n                end = max(end, interval.end);\r\n            }                \r\n        }\r\n        \r\n        vector&lt;Interval&gt; ans(std::move(l));\r\n        ans.emplace_back(start, end);\r\n        ans.insert(ans.end(), r.begin(), r.end());\r\n        return ans;\r\n    }\r\n};<\/pre>\n<p>&nbsp;<\/p>\n<p>Python<\/p>\n<pre class=\"lang:python decode:true\">\"\"\"\r\nAuthor: Huahua\r\nRuntime: 68 ms\r\n\"\"\"\r\nclass Solution(object):\r\n    def insert(self, intervals, newInterval):\r\n        start, end = newInterval.start, newInterval.end\r\n        l, r = [], []        \r\n        for interval in intervals:\r\n            if interval.end &lt; start: l += interval, \r\n            elif interval.start &gt; end: r += interval,\r\n            else: \r\n                start = min(start, interval.start)\r\n                end = max(end, interval.end)\r\n        return l + [Interval(start, end)] + r<\/pre>\n<p>&nbsp;<\/p>\n<p><strong>Related problems:<\/strong><\/p>\n<ul>\n<li><a href=\"http:\/\/zxi.mytechroad.com\/blog\/geometry\/leetcode-56-merge-intervals\/\">[\u89e3\u9898\u62a5\u544a] LeetCode 56. Merge Intervals<\/a><\/li>\n<li><a href=\"http:\/\/zxi.mytechroad.com\/blog\/tree\/leetcode-218-the-skyline-problem\/\">[\u89e3\u9898\u62a5\u544a] LeetCode 218. The Skyline Problem<\/a><\/li>\n<\/ul>\n","protected":false},"excerpt":{"rendered":"<p>Problem: Given a set of\u00a0non-overlapping\u00a0intervals, insert a new interval into the intervals (merge if necessary). You may assume that the intervals were initially sorted according&#8230;<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[127],"tags":[128,129],"class_list":["post-586","post","type-post","status-publish","format-standard","hentry","category-geometry","tag-interval","tag-merge","entry","simple"],"_links":{"self":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/586","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=586"}],"version-history":[{"count":9,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/586\/revisions"}],"predecessor-version":[{"id":2661,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/586\/revisions\/2661"}],"wp:attachment":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/media?parent=586"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/categories?post=586"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/tags?post=586"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}