0757 solved.

liuyubobobo · liuyubobobo · commit 2a8d1e4ebb79 · 2022-07-23T21:48:08.000-07:00
diff --git a/0501-1000/0757-Set-Intersection-Size-At-Least-Two/cpp-0757/CMakeLists.txt b/0501-1000/0757-Set-Intersection-Size-At-Least-Two/cpp-0757/CMakeLists.txt
@@ -0,0 +1,6 @@
+cmake_minimum_required(VERSION 3.22)
+project(cpp_0757)
+
+set(CMAKE_CXX_STANDARD 14)
+
+add_executable(cpp_0757 main.cpp)
diff --git a/0501-1000/0757-Set-Intersection-Size-At-Least-Two/cpp-0757/main.cpp b/0501-1000/0757-Set-Intersection-Size-At-Least-Two/cpp-0757/main.cpp
@@ -0,0 +1,49 @@
+#include <iostream>
+#include <vector>
+#include <algorithm>
+#include <cassert>
+
+using namespace std;
+
+
+class Solution {
+public:
+    int intersectionSizeTwo(vector<vector<int>>& intervals) {
+
+        sort(intervals.begin(), intervals.end(),
+             [](const vector<int>& interval1, const vector<int>& interval2){
+
+            if(interval1[1] != interval2[1]) return interval1[1] < interval2[1];
+            return interval1[0] >= interval2[0];
+        });
+
+        int res = 2, largest1 = intervals[0][1], largest2 = intervals[0][1] - 1;
+        for(int i = 1; i < intervals.size(); i ++){
+            int a = intervals[i][0], b = intervals[i][1];
+            if(a <= largest2 && largest1 <= b){
+                continue;
+            }
+            else if(largest1 >= a){
+                res ++;
+                largest2 = largest1;
+                largest1 = b;
+            }
+            else{
+                res += 2;
+                largest1 = b;
+                largest2 = b - 1;
+            }
+        }
+        return res;
+    }
+};
+
+
+int main() {
+
+    vector<vector<int>> intervals1 = {{1,3},{1,4},{2,5},{3,5}};
+    cout << Solution().intersectionSizeTwo(intervals1) << '\n';
+    // 3
+
+    return 0;
+}
diff --git a/readme.md b/readme.md
@@ -760,6 +760,8 @@ email: [liuyubobobo@gmail.com](mailto:liuyubobobo@gmail.com)
 | 753 | [Cracking the Safe](https://leetcode.com/problems/cracking-the-safe/) | [无] | [C++](0501-1000/0753-Cracking-the-Safe/cpp-0753/) | | |
 | 754 | [Reach a Number](https://leetcode.com/problems/reach-a-number/) | [Solution](https://leetcode.com/problems/reach-a-number/solution/) | [C++](0501-1000/0754-Reach-a-Number/cpp-0754/) | | |
 | | | | | | |
+| 757 | [Set Intersection Size At Least Two](https://leetcode.com/problems/set-intersection-size-at-least-two/) | [无] | [C++](0501-1000/0757-Set-Intersection-Size-At-Least-Two/cpp-0757/) | | |
+| | | | | | |
 | 761 | [Special Binary String](https://leetcode.com/problems/special-binary-string/) | [solution](https://leetcode.com/problems/special-binary-string/solution/) |  [C++](0501-1000/0761-Special-Binary-String/cpp-0761/) | | |
 | 762 | [Prime Number of Set Bits in Binary Representation](https://leetcode.com/problems/prime-number-of-set-bits-in-binary-representation/) | [无] | [C++](0501-1000/0762-Prime-Number-of-Set-Bits-in-Binary-Representation/cpp-0762/) | | |
 | 763 | [Partition Labels](https://leetcode.com/problems/partition-labels/) | [无] | [C++](0501-1000/0763-Partition-Labels/cpp-0763/) | | |
