0986 solved.

liuyubobobo · liuyubobobo · commit 730074927162 · 2019-02-04T14:16:16.000-08:00
diff --git a/0986-Interval-List-Intersections/cpp-0986/CMakeLists.txt b/0986-Interval-List-Intersections/cpp-0986/CMakeLists.txt
@@ -0,0 +1,6 @@
+cmake_minimum_required(VERSION 3.13)
+project(C)
+
+set(CMAKE_CXX_STANDARD 11)
+
+add_executable(C main.cpp)
diff --git a/0986-Interval-List-Intersections/cpp-0986/main.cpp b/0986-Interval-List-Intersections/cpp-0986/main.cpp
@@ -0,0 +1,73 @@
+/// Source : https://leetcode.com/problems/interval-list-intersections/
+/// Author : liuyubobobo
+/// Time   : 2019-02-04
+
+#include <iostream>
+#include <vector>
+#include <stack>
+
+using namespace std;
+
+
+/// Ad-Hoc
+/// Time Complexity: O(m + n)
+/// Space Complexity: O(1)
+
+/// Definition for an interval.
+struct Interval {
+    int start;
+    int end;
+    Interval() : start(0), end(0) {}
+    Interval(int s, int e) : start(s), end(e) {}
+};
+
+class Solution {
+public:
+    vector<Interval> intervalIntersection(vector<Interval>& A, vector<Interval>& B) {
+
+        vector<Interval> res;
+
+        int i = 0, j = 0;
+        while(i < A.size() && j < B.size()){
+
+            int l = max(A[i].start, B[j].start);
+            int h = min(A[i].end, B[j].end);
+            if(l <= h)
+                res.push_back(Interval(l, h));
+
+            if(A[i].end <= B[j].end)
+                i ++;
+            else
+                j ++;
+        }
+        return res;
+    }
+};
+
+
+void print_vec(const vector<Interval>& vec){
+
+    for(const Interval& interval: vec)
+        cout << "(" << interval.start << "," << interval.end << ") ";
+    cout << endl;
+}
+
+int main() {
+
+    vector<Interval> A1 = {Interval(0,2),Interval(5,10),Interval(13,23),Interval(24,25)};
+    vector<Interval> B1 = {Interval(1,5),Interval(8,12),Interval(15,24),Interval(25,26)};
+    print_vec(Solution().intervalIntersection(A1, B1));
+    // [[1,2],[5,5],[8,10],[15,23],[24,24],[25,25]]
+
+    vector<Interval> A2 = {Interval(5,10)};
+    vector<Interval> B2 = {Interval(5,10)};
+    print_vec(Solution().intervalIntersection(A2, B2));
+    // [[5, 10]]
+
+    vector<Interval> A3 = {Interval(3,5), Interval(9, 20)};
+    vector<Interval> B3 = {Interval(4,5), Interval(7, 10), Interval(11, 12), Interval(14, 15), Interval(16, 20)};
+    print_vec(Solution().intervalIntersection(A3, B3));
+    // [[4,5],[9,10],[11,12],[14,15],[16,20]]
+
+    return 0;
+}
diff --git a/readme.md b/readme.md
@@ -641,7 +641,7 @@ email: [liuyubobobo@gmail.com](mailto:liuyubobobo@gmail.com)
 | 983 | [Minimum Cost For Tickets](https://leetcode.com/problems/minimum-cost-for-tickets/) | [solution](https://leetcode.com/problems/minimum-cost-for-tickets/solution/) | [C++](0983-Minimum-Cost-For-Tickets/cpp-0983/) | | |
 | 984 | [String Without AAA or BBB](https://leetcode.com/problems/string-without-aaa-or-bbb/) | [solution](https://leetcode.com/problems/string-without-aaa-or-bbb/solution/) | [C++](0984-String-Without-AAA-or-BBB/cpp-0984/) | | |
 | 985 | [Sum of Even Numbers After Queries](https://leetcode.com/problems/sum-of-even-numbers-after-queries/) | [solution](https://leetcode.com/problems/sum-of-even-numbers-after-queries/) | [C++](0985-Sum-of-Even-Numbers-After-Queries/cpp-0985/) | | |
-| | | | | | |
+| 986 | [Interval List Intersections](https://leetcode.com/problems/interval-list-intersections/) | [solution](https://leetcode.com/problems/interval-list-intersections/solution/) | [C++](0986-Interval-List-Intersections/cpp-0986/) | | |
 | 987 | [Vertical Order Traversal of a Binary Tree](https://leetcode.com/problems/vertical-order-traversal-of-a-binary-tree/) | [solution](https://leetcode.com/problems/vertical-order-traversal-of-a-binary-tree/solution/) | [C++](0987-Vertical-Order-Traversal-of-a-Binary-Tree/cpp-0987/) | | |
 | 988 | [Smallest String Starting From Leaf](https://leetcode.com/problems/smallest-string-starting-from-leaf/) | [solution](https://leetcode.com/problems/smallest-string-starting-from-leaf/solution/) | [C++](0988-Smallest-String-Starting-From-Leaf/cpp-0988/) | | |
 | | | | | | |
